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 listOct 20, 2026 07:48e1011e1011Score: 85,902Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 07:5084,43242,218,74330,053,0001,187,0002,113,536
2Oct 20, 2026 07:5084,61042,197,83130,201,0001,105,0002,113,536
3Oct 20, 2026 07:5084,99142,992,00630,423,0001,024,0002,113,536
4Oct 20, 2026 07:5085,12942,406,03630,387,0001,111,0002,113,536
5Oct 20, 2026 07:5085,90242,703,25530,664,0001,120,0002,113,536
6Oct 20, 2026 07:5085,91043,256,73430,605,0001,182,0002,113,536
7Oct 20, 2026 07:5086,11343,830,44430,665,0001,197,0002,113,536
8Oct 20, 2026 07:5087,24343,769,73531,094,0001,186,0002,113,536
9Oct 20, 2026 07:5096,02746,445,53234,392,0001,138,0002,113,536