TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listMay 14, 2026 16:54Josu San MartinJosu San MartinScore: 110,164Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 17:08109,94849,489,44840,681,00002,113,536
2May 14, 2026 17:08109,95949,696,89140,685,00002,113,536
3May 14, 2026 17:08110,02449,486,32040,709,00002,113,536
4May 14, 2026 17:08110,05648,805,13540,721,00002,113,536
5May 14, 2026 17:08110,16449,714,60140,761,00002,113,536
6May 14, 2026 17:08110,16749,674,09640,762,00002,113,536
7May 14, 2026 17:08110,57256,884,67839,903,0001,009,0002,113,536
8May 14, 2026 17:08110,63756,911,76940,936,00002,113,536
9May 14, 2026 17:08111,82158,502,42640,368,0001,006,0002,113,536