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 22:34Victor MerckléVictor MerckléScore: 64,691Success
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 22:3564,28132,657,43822,779,0001,005,0002,113,536
2May 11, 2026 22:3564,54335,571,98322,793,0001,088,0002,113,536
3May 11, 2026 22:3564,60534,384,69222,804,0001,100,0002,113,536
4May 11, 2026 22:3564,64335,825,85422,841,0001,077,0002,113,536
5May 11, 2026 22:3564,69135,177,64122,856,0001,080,0002,113,536
6May 11, 2026 22:3564,76734,459,47122,862,0001,102,0002,113,536
7May 11, 2026 22:3565,05136,010,29522,973,0001,096,0002,113,536
8May 11, 2026 22:3565,06232,819,40622,985,0001,088,0002,113,536
9May 11, 2026 22:3565,12435,718,06323,000,0001,096,0002,113,536