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 31, 2026 12:39Victor MerckléVictor MerckléScore: 56,510Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 12:4056,26229,148,17619,786,0001,031,0002,121,728stderr
2Aug 31, 2026 12:4056,38629,233,57819,829,0001,034,0002,121,728stderr
3Aug 31, 2026 12:4056,43729,954,43519,823,0001,059,0002,121,728stderr
4Aug 31, 2026 12:4056,50230,005,46419,857,0001,049,0002,121,728stderr
5Aug 31, 2026 12:4056,51029,214,45019,858,0001,051,0002,121,728stderr
6Aug 31, 2026 12:4056,53230,732,68319,858,0001,059,0002,121,728stderr
7Aug 31, 2026 12:4056,56729,189,37219,881,0001,049,0002,121,728stderr
8Aug 31, 2026 12:4060,14036,304,49921,245,0001,007,0002,121,728stderr
9Aug 31, 2026 12:40145,43772,037,88552,735,0001,077,0002,121,728stderr