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:02Victor MerckléVictor MerckléScore: 67,700Success
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:0367,29435,655,54023,717,0001,182,0002,113,536
2May 11, 2026 16:0367,35433,660,20323,726,0001,195,0002,113,536
3May 11, 2026 16:0367,53733,819,93123,784,0001,205,0002,113,536
4May 11, 2026 16:0367,54335,328,36923,792,0001,199,0002,113,536
5May 11, 2026 16:0367,70033,843,04323,856,0001,193,0002,113,536
6May 11, 2026 16:0367,86733,884,69923,919,0001,192,0002,113,536
7May 11, 2026 16:0367,91834,190,45523,912,0001,218,0002,113,536
8May 11, 2026 16:0367,93233,872,30023,945,0001,190,0002,113,536
9May 11, 2026 16:0368,20034,001,24624,024,0001,210,0002,113,536