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 20:33Victor MerckléVictor MerckléScore: 66,586Success
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 20:3466,37834,357,77423,474,0001,086,0002,113,536
2May 11, 2026 20:3466,38333,451,63723,474,0001,088,0002,113,536
3May 11, 2026 20:3466,54036,053,17023,609,0001,011,0002,113,536
4May 11, 2026 20:3466,54533,345,84623,544,0001,078,0002,113,536
5May 11, 2026 20:3466,58635,538,60023,524,0001,113,0002,113,536
6May 11, 2026 20:3466,62733,401,99823,550,0001,102,0002,113,536
7May 11, 2026 20:3466,89735,116,22523,659,0001,093,0002,113,536
8May 11, 2026 20:3466,93233,562,78523,655,0001,110,0002,113,536
9May 11, 2026 20:3466,98133,496,51023,684,0001,099,0002,113,536