Standing Ovation solutions
Standing Ovation was solved using Lisp by 33 contestants. Solution sizes: average 1243 bytes (shortest: 453; longest: 3551).
The list below is sorted by solution size. You can also sort by ranking.
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() |
Standing Ovation was solved using Lisp by 33 contestants. Solution sizes: average 1243 bytes (shortest: 453; longest: 3551).
The list below is sorted by solution size. You can also sort by ranking.
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() |