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 listJun 24, 2026 10:10Victor MerckléVictor MerckléScore: 63,643Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 10:1163,09130,801,08823,344,00002,113,536
2Jun 24, 2026 10:1163,37231,513,67522,423,0001,025,0002,113,536
3Jun 24, 2026 10:1163,55131,002,35222,495,0001,019,0002,113,536
4Jun 24, 2026 10:1163,62731,215,82522,534,0001,008,0002,113,536
5Jun 24, 2026 10:1163,64331,616,13322,518,0001,030,0002,113,536
6Jun 24, 2026 10:1163,80531,642,21022,581,0001,027,0002,113,536
7Jun 24, 2026 10:1163,93731,756,81222,627,0001,030,0002,113,536
8Jun 24, 2026 10:1164,08631,207,68222,711,0001,001,0002,113,536
9Jun 24, 2026 10:1164,26231,768,07422,764,0001,013,0002,113,536