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 09:25e1011e1011Score: 98,589Success
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 09:2797,31846,904,42234,901,0001,107,0002,113,536
2Oct 20, 2026 09:2797,64847,563,50634,942,0001,188,0002,113,536
3Oct 20, 2026 09:2797,99147,663,71035,084,0001,173,0002,113,536
4Oct 20, 2026 09:2798,12147,796,01235,107,0001,198,0002,113,536
5Oct 20, 2026 09:2798,58947,504,57835,280,0001,198,0002,113,536
6Oct 20, 2026 09:2798,78647,973,70935,349,0001,202,0002,113,536
7Oct 20, 2026 09:27101,94849,094,68530,728,0006,993,0002,113,536
8Oct 20, 2026 09:27105,68650,551,54435,032,0004,072,0002,113,536
9Oct 20, 2026 09:27107,87251,326,31534,964,0004,949,0002,113,536