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 listJul 2, 2026 11:51IlyaIlyaScore: 58,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 11:5358,78331,175,99920,631,0001,119,0002,113,536
2Jul 2, 2026 11:5358,79131,268,43020,652,0001,101,0002,113,536
3Jul 2, 2026 11:5358,83231,246,28020,650,0001,118,0002,113,536
4Jul 2, 2026 11:5358,91331,751,84020,687,0001,111,0002,113,536
5Jul 2, 2026 11:5358,93231,279,75720,697,0001,108,0002,113,536
6Jul 2, 2026 11:5358,98631,338,91320,705,0001,120,0002,113,536
7Jul 2, 2026 11:5359,01831,333,08920,721,0001,116,0002,113,536
8Jul 2, 2026 11:5359,12132,943,35020,708,0001,167,0002,113,536
9Jul 2, 2026 11:5360,90241,595,25421,305,0001,229,0002,113,536