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 15:06Victor MerckléVictor MerckléScore: 58,451Success
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 15:0758,36431,377,56120,588,0001,007,0002,113,536
2Aug 28, 2026 15:0758,37030,659,17020,557,0001,040,0002,113,536
3Aug 28, 2026 15:0758,38330,751,97420,571,0001,031,0002,113,536
4Aug 28, 2026 15:0758,43530,009,39920,615,0001,006,0002,113,536
5Aug 28, 2026 15:0758,45130,717,30920,594,0001,033,0002,113,536
6Aug 28, 2026 15:0758,54830,717,75220,657,0001,006,0002,113,536
7Aug 28, 2026 15:0758,57030,749,31820,657,0001,014,0002,113,536
8Aug 28, 2026 15:0758,59729,824,92520,671,0001,010,0002,113,536
9Aug 28, 2026 15:07145,70062,301,21952,878,0001,031,0002,113,536