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:06Victor MerckléVictor MerckléScore: 65,916Success
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:0765,41836,314,06923,192,0001,013,0002,113,536
2May 11, 2026 17:0765,60834,719,17023,264,0001,011,0002,113,536
3May 11, 2026 17:0765,80035,057,29423,243,0001,103,0002,113,536
4May 11, 2026 17:0765,82435,222,13423,247,0001,108,0002,113,536
5May 11, 2026 17:0765,91635,007,10023,289,0001,100,0002,113,536
6May 11, 2026 17:0765,99134,139,46423,313,0001,104,0002,113,536
7May 11, 2026 17:0766,01334,986,83023,392,0001,033,0002,113,536
8May 11, 2026 17:0766,33736,101,91123,451,0001,094,0002,113,536
9May 11, 2026 17:0766,39433,801,19323,443,0001,123,0002,113,536