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 18, 2026 18:12M-RochatM-RochatScore: 72,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 18:1367,17535,830,95123,693,0001,162,0002,113,536
2May 18, 2026 18:1367,21634,617,76823,800,0001,070,0002,113,536
3May 18, 2026 18:1367,22435,334,03723,719,0001,154,0002,113,536
4May 18, 2026 18:1372,31036,759,62725,675,0001,080,0002,113,536
5May 18, 2026 18:1372,36737,727,63925,696,0001,080,0002,113,536
6May 18, 2026 18:1372,38138,857,05225,615,0001,166,0002,113,536
7May 18, 2026 18:1372,95936,092,39725,915,0001,080,0002,113,536
8May 18, 2026 18:1373,18138,532,42425,928,0001,149,0002,113,536
9May 18, 2026 18:1373,65638,644,31326,244,0001,009,0002,113,536