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 11, 2026 16:56Victor MerckléVictor MerckléScore: 66,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 16:5766,55935,162,30023,614,0001,013,0002,113,536
2May 11, 2026 16:5766,60833,529,02323,626,0001,019,0002,113,536
3May 11, 2026 16:5766,65633,918,25523,643,0001,020,0002,113,536
4May 11, 2026 16:5766,66234,651,23423,524,0001,141,0002,113,536
5May 11, 2026 16:5766,68636,463,58823,663,0001,011,0002,113,536
6May 11, 2026 16:5766,75933,466,36923,517,0001,184,0002,113,536
7May 11, 2026 16:5767,01334,414,87223,664,0001,131,0002,113,536
8May 11, 2026 16:5767,10836,446,20923,819,0001,011,0002,113,536
9May 11, 2026 16:5767,10834,558,34723,809,0001,021,0002,113,536