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:58M-RochatM-RochatScore: 59,581Success
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:5959,42431,246,24820,932,0001,055,0002,113,536
2May 21, 2026 18:5959,47231,233,40520,856,0001,149,0002,113,536
3May 21, 2026 18:5959,49131,886,20220,860,0001,152,0002,113,536
4May 21, 2026 18:5959,51033,350,18520,862,0001,157,0002,113,536
5May 21, 2026 18:5959,58131,294,19420,891,0001,154,0002,113,536
6May 21, 2026 18:5959,58632,242,86220,902,0001,145,0002,113,536
7May 21, 2026 18:5959,77231,347,76320,947,0001,169,0002,113,536
8May 21, 2026 18:5959,80231,940,31120,961,0001,166,0002,113,536
9May 21, 2026 18:5959,80834,125,77320,965,0001,164,0002,113,536