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 listAug 28, 2026 16:19Victor MerckléVictor MerckléScore: 57,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 16:2057,10830,191,50220,125,0001,005,0002,113,536
2Aug 28, 2026 16:2057,12429,515,31320,100,0001,036,0002,113,536
3Aug 28, 2026 16:2057,17231,447,90020,143,0001,011,0002,113,536
4Aug 28, 2026 16:2057,25630,268,28120,176,0001,009,0002,113,536
5Aug 28, 2026 16:2057,28329,357,54920,172,0001,023,0002,113,536
6Aug 28, 2026 16:2057,30829,373,00820,191,0001,013,0002,113,536
7Aug 28, 2026 16:2057,41830,317,38220,240,0001,005,0002,113,536
8Aug 28, 2026 16:2057,42429,626,12620,245,0001,002,0002,113,536
9Aug 28, 2026 16:20145,68362,932,88952,902,0001,001,0002,113,536