Pegman solutions
Pegman was solved using Haskell by 24 contestants. Solution sizes: average 2887 bytes (shortest: 1123; longest: 6236).
The list below is sorted by solution size. You can also sort by ranking.
![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() |
Pegman was solved using Haskell by 24 contestants. Solution sizes: average 2887 bytes (shortest: 1123; longest: 6236).
The list below is sorted by solution size. You can also sort by ranking.
![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() |