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:50e1011e1011Score: 107,394Success
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:52100,35948,626,77935,946,0001,187,0002,113,536
2Oct 20, 2026 07:52101,81650,558,24636,653,0001,019,0002,113,536
3Oct 20, 2026 07:52102,30048,751,13336,760,0001,091,0002,113,536
4Oct 20, 2026 07:52105,18949,818,09137,727,0001,193,0002,113,536
5Oct 20, 2026 07:52107,39450,615,47138,633,0001,103,0002,113,536
6Oct 20, 2026 07:52107,41350,658,30938,647,0001,096,0002,113,536
7Oct 20, 2026 07:52107,86750,796,89138,824,0001,087,0002,113,536
8Oct 20, 2026 07:52107,86751,003,43938,723,0001,188,0002,113,536
9Oct 20, 2026 07:52109,71851,538,08839,486,0001,110,0002,113,536