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 17:10Victor MerckléVictor MerckléScore: 66,408Success
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 17:1166,20536,013,78123,405,0001,091,0002,113,536
2May 11, 2026 17:1166,21335,402,33123,407,0001,092,0002,113,536
3May 11, 2026 17:1166,28636,238,11123,421,0001,105,0002,113,536
4May 11, 2026 17:1166,38935,184,69723,457,0001,107,0002,113,536
5May 11, 2026 17:1166,40835,369,14523,463,0001,108,0002,113,536
6May 11, 2026 17:1166,41037,182,86823,475,0001,097,0002,113,536
7May 11, 2026 17:1166,46235,373,57623,571,0001,020,0002,113,536
8May 11, 2026 17:1166,78334,103,60123,622,0001,088,0002,113,536
9May 11, 2026 17:1166,81035,988,70623,618,0001,102,0002,113,536