Candy Splitting solutions
Candy Splitting was solved using OCaml by 19 contestants. Solution sizes: average 1202 bytes (shortest: 457; longest: 8870).
The list below is sorted by solution size. You can also sort by ranking.
 gnomnain (S) (457 B) gnomnain (L) (457 B) Haveo (S) (494 B) Haveo (L) (494 B) aleksey (S) (497 B) |
aleksey (L) (497 B) nickie (S) (526 B) nickie (L) (526 B) kp7 (S) (673 B) kp7 (L) (673 B) |
Skywalker8921 (S) (787 B) Skywalker8921 (L) (787 B) nuffer (S) (1090 B) nuffer (L) (1090 B) nyufac (S) (1100 B) |
nyufac (L) (1100 B) xsd (S) (1369 B) xsd (L) (1369 B) Altharaz (S) (8870 B) |