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 16:20Victor MerckléVictor MerckléScore: 79,813Success
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 16:2179,22439,681,99328,178,0001,135,0002,113,536
2May 11, 2026 16:2179,27838,040,55128,200,0001,133,0002,113,536
3May 11, 2026 16:2179,48339,051,63528,270,0001,139,0002,113,536
4May 11, 2026 16:2179,72738,105,50528,326,0001,173,0002,113,536
5May 11, 2026 16:2179,81338,240,55128,380,0001,151,0002,113,536
6May 11, 2026 16:2179,93238,319,23428,447,0001,128,0002,113,536
7May 11, 2026 16:2179,96738,424,28628,364,0001,224,0002,113,536
8May 11, 2026 16:2180,00538,316,72828,471,0001,131,0002,113,536
9May 11, 2026 16:2180,29438,626,16728,561,0001,148,0002,113,536