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:46Victor MerckléVictor MerckléScore: 67,681Success
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:4767,23235,444,58123,643,0001,233,0002,113,536
2May 11, 2026 15:4767,25635,508,92823,684,0001,201,0002,113,536
3May 11, 2026 15:4767,28333,654,61423,688,0001,207,0002,113,536
4May 11, 2026 15:4767,34833,665,31023,715,0001,204,0002,113,536
5May 11, 2026 15:4767,68133,609,53123,820,0001,222,0002,113,536
6May 11, 2026 15:4767,69733,767,20023,848,0001,200,0002,113,536
7May 11, 2026 15:4767,73733,789,59423,861,0001,202,0002,113,536
8May 11, 2026 15:47189,92479,084,76469,102,0001,170,0002,113,536
9May 11, 2026 15:47189,95681,143,70769,078,0001,206,0002,113,536