Cheating a Boolean Tree solutions

Cheating a Boolean Tree was solved using Ruby by 28 contestants. Solution sizes: average 2875 bytes (shortest: 1187; longest: 5204).

The list below is sorted by solution size. You can also sort by ranking.

irori (S) (1187 B)

irori (L) (1187 B)

kik (S) (1422 B)

kik (L) (1422 B)

lgd (S) (1478 B)

libc (S) (1626 B)

libc (L) (1626 B)

poga (S) (2121 B)

Calamitas (S) (2237 B)

Calamitas (L) (2237 B)

alchematon (S) (2380 B)

alchematon (L) (2380 B)

Aekeri (S) (2632 B)

rambo4.0 (L) (2666 B)

rambo4.0 (S) (2684 B)

Aekeri (L) (2731 B)

eric.i (S) (2822 B)

Yoshi (S) (3483 B)

Yoshi (L) (3483 B)

Sagara (S) (3560 B)

Sagara (L) (3560 B)

AlecN (S) (3976 B)

AlecN (L) (3976 B)

visq (S) (4349 B)

visq (L) (4349 B)

eric.i (L) (4548 B)

Wam (L) (5193 B)

Wam (S) (5204 B)