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 16, 2026 15:34M-RochatM-RochatScore: 73,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 15:3473,65437,738,36026,232,0001,020,0002,113,536
2May 16, 2026 15:3473,69736,031,12725,992,0001,276,0002,113,536
3May 16, 2026 15:3473,74837,300,85626,250,0001,037,0002,113,536
4May 16, 2026 15:3473,88936,037,37526,055,0001,284,0002,113,536
5May 16, 2026 15:3473,94337,717,78826,339,0001,020,0002,113,536
6May 16, 2026 15:3474,13536,209,79626,387,0001,043,0002,113,536
7May 16, 2026 15:3474,14336,137,57026,399,0001,034,0002,113,536
8May 16, 2026 15:3474,21636,170,02526,244,0001,216,0002,113,536
9May 16, 2026 15:3474,44037,168,84726,499,0001,044,0002,113,536