Hot Dog Proliferation solutions
Hot Dog Proliferation was solved using Java by 28 contestants. Solution sizes: average 3501 bytes (shortest: 1122; longest: 9952).
The list below is sorted by solution size. You can also sort by ranking.
![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Hot Dog Proliferation was solved using Java by 28 contestants. Solution sizes: average 3501 bytes (shortest: 1122; longest: 9952).
The list below is sorted by solution size. You can also sort by ranking.
![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() |