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 listJun 25, 2026 04:08Victor MerckléVictor MerckléScore: 108,743Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 04:09108,57847,876,86739,171,0001,003,0002,117,632stderr
2Jun 25, 2026 04:09108,59747,638,08439,147,0001,034,0002,117,632stderr
3Jun 25, 2026 04:09108,62147,584,98039,146,0001,044,0002,117,632stderr
4Jun 25, 2026 04:09108,72147,631,46539,203,0001,024,0002,117,632stderr
5Jun 25, 2026 04:09108,74347,680,30139,204,0001,031,0002,117,632stderr
6Jun 25, 2026 04:09108,91647,720,46339,293,0001,006,0002,117,632stderr
7Jun 25, 2026 04:09108,96247,805,58139,282,0001,034,0002,117,632stderr
8Jun 25, 2026 04:09108,97048,155,28639,250,0001,069,0002,117,632stderr
9Jun 25, 2026 04:09109,16447,857,20139,317,0001,074,0002,117,632stderr