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 listSep 20, 2026 14:54Andrew EpsteinAndrew EpsteinScore: 56,697Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2026 14:5556,57829,740,11720,934,00002,113,536
2Sep 20, 2026 14:5556,59429,779,43620,940,00002,113,536
3Sep 20, 2026 14:5556,61029,828,54620,946,00002,113,536
4Sep 20, 2026 14:5556,68629,772,52220,974,00002,113,536
5Sep 20, 2026 14:5556,69729,829,81920,978,00002,113,536
6Sep 20, 2026 14:5556,79429,885,31821,014,00002,113,536
7Sep 20, 2026 14:5556,88629,811,62420,045,0001,003,0002,113,536
8Sep 20, 2026 14:5556,90529,893,39621,055,00002,113,536
9Sep 20, 2026 14:5556,96229,658,92720,066,0001,010,0002,113,536