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 listJun 30, 2026 18:03IlyaIlyaScore: 58,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 18:0558,72931,225,74520,624,0001,106,0002,113,536
2Jun 30, 2026 18:0558,74531,218,36020,630,0001,106,0002,113,536
3Jun 30, 2026 18:0558,77031,241,16620,643,0001,102,0002,113,536
4Jun 30, 2026 18:0558,78131,201,80220,661,0001,088,0002,113,536
5Jun 30, 2026 18:0558,91331,233,66220,699,0001,099,0002,113,536
6Jun 30, 2026 18:0558,96231,322,24120,628,0001,188,0002,113,536
7Jun 30, 2026 18:0559,01631,328,55420,720,0001,116,0002,113,536
8Jun 30, 2026 18:0559,02131,377,01620,707,0001,131,0002,113,536
9Jun 30, 2026 18:0559,07831,400,47920,721,0001,138,0002,113,536