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 15:18Victor MerckléVictor MerckléScore: 70,913Success
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 15:1970,75635,495,00125,019,0001,161,0002,113,536
2May 11, 2026 15:1970,81635,717,76324,986,0001,216,0002,113,536
3May 11, 2026 15:1970,84034,985,02324,988,0001,223,0002,113,536
4May 11, 2026 15:1970,91035,161,25025,034,0001,203,0002,113,536
5May 11, 2026 15:1970,91336,475,20525,031,0001,207,0002,113,536
6May 11, 2026 15:1970,97836,443,92625,034,0001,228,0002,113,536
7May 11, 2026 15:1971,04335,005,54425,123,0001,163,0002,113,536
8May 11, 2026 15:1971,15936,048,69725,162,0001,167,0002,113,536
9May 11, 2026 15:1971,20237,579,58225,132,0001,213,0002,113,536