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 21, 2026 18:41M-RochatM-RochatScore: 59,562Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 18:4259,44333,419,01420,842,0001,152,0002,113,536
2May 21, 2026 18:4259,50833,080,72520,860,0001,158,0002,113,536
3May 21, 2026 18:4259,54333,036,11120,865,0001,166,0002,113,536
4May 21, 2026 18:4259,55131,301,06920,882,0001,152,0002,113,536
5May 21, 2026 18:4259,56231,734,86420,895,0001,143,0002,113,536
6May 21, 2026 18:4259,57532,129,96920,980,0001,063,0002,113,536
7May 21, 2026 18:4259,58334,365,23320,887,0001,159,0002,113,536
8May 21, 2026 18:4259,60833,353,56420,978,0001,077,0002,113,536
9May 21, 2026 18:4259,68634,513,09020,996,0001,088,0002,113,536