Falling Diamonds solutions
Falling Diamonds was solved using Haskell by 20 contestants. Solution sizes: average 1990 bytes (shortest: 942; longest: 6109).
The list below is sorted by solution size. You can also sort by ranking.
 jmazon (S) (942 B) PositivaPatrik (S) (966 B) kappahouse (S) (989 B) kappahouse (L) (989 B) notogawa (S) (1012 B) |
tos.lunar (S) (1067 B) tos.lunar (L) (1067 B) Bulsa (S) (1141 B) Sam.Eisenstat (S) (1318 B) Sam.Eisenstat (L) (1318 B) |
falsifian (S) (1330 B) falsifian (L) (1397 B) thom.carver (S) (1471 B) RaphaelJ (S) (1768 B) twanvl (S) (1800 B) |
yangjay (S) (2516 B) yangjay (L) (3180 B) lemonidas (S) (3315 B) yairchu (S) (6109 B) yairchu (L) (6109 B) |