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 21, 2026 19:03M-RochatM-RochatScore: 58,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 19:0458,76733,410,61720,719,0001,025,0002,113,536
2May 21, 2026 19:0458,77831,584,51120,714,0001,034,0002,113,536
3May 21, 2026 19:0458,82430,957,18520,742,0001,023,0002,113,536
4May 21, 2026 19:0458,85132,271,11120,740,0001,035,0002,113,536
5May 21, 2026 19:0458,90529,565,22420,777,0001,018,0002,113,536
6May 21, 2026 19:0458,91331,277,25120,763,0001,035,0002,113,536
7May 21, 2026 19:0459,05130,910,47720,820,0001,029,0002,113,536
8May 21, 2026 19:0459,05930,578,65420,826,0001,026,0002,113,536
9May 21, 2026 19:0459,06729,824,88020,829,0001,026,0002,113,536