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:46Victor MerckléVictor MerckléScore: 58,354Success
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:4658,19730,645,63120,368,0001,165,0002,113,536
2Aug 28, 2026 15:4658,25429,919,25720,400,0001,154,0002,113,536
3Aug 28, 2026 15:4658,27830,661,00720,397,0001,166,0002,113,536
4Aug 28, 2026 15:4658,30030,674,41320,412,0001,159,0002,113,536
5Aug 28, 2026 15:4658,35430,011,78220,467,0001,124,0002,113,536
6Aug 28, 2026 15:4658,36430,695,08020,415,0001,180,0002,113,536
7Aug 28, 2026 15:4658,40830,708,21820,437,0001,174,0002,113,536
8Aug 28, 2026 15:4658,48630,858,07220,428,0001,212,0002,113,536
9Aug 28, 2026 15:4658,48630,733,32020,469,0001,171,0002,113,536