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 listMay 16, 2026 07:07M-RochatM-RochatScore: 77,232Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 07:0976,97037,762,22427,189,0001,290,0002,113,536
2May 16, 2026 07:0976,99438,529,98227,459,0001,029,0002,113,536
3May 16, 2026 07:0977,04337,633,37427,215,0001,291,0002,113,536
4May 16, 2026 07:0977,13238,738,22027,511,0001,028,0002,113,536
5May 16, 2026 07:0977,23237,498,73327,538,0001,038,0002,113,536
6May 16, 2026 07:0977,25937,157,42427,535,0001,051,0002,113,536
7May 16, 2026 07:0977,65437,961,10127,668,0001,064,0002,113,536
8May 16, 2026 07:0977,74337,510,61527,463,0001,302,0002,113,536
9May 16, 2026 07:0977,90039,288,63627,523,0001,300,0002,113,536