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:15M-RochatM-RochatScore: 59,686Success
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:1759,59432,950,50220,899,0001,151,0002,113,536
2May 18, 2026 18:1759,63732,137,62920,900,0001,166,0002,113,536
3May 18, 2026 18:1759,64531,781,95820,900,0001,169,0002,113,536
4May 18, 2026 18:1759,66731,319,01620,920,0001,157,0002,113,536
5May 18, 2026 18:1759,68633,383,50320,925,0001,159,0002,113,536
6May 18, 2026 18:1759,83531,864,17420,990,0001,149,0002,117,632
7May 18, 2026 18:1759,87032,361,28520,995,0001,157,0002,113,536
8May 18, 2026 18:1759,87233,040,72320,987,0001,166,0002,113,536
9May 18, 2026 18:17117,28154,351,88942,256,0001,138,0002,113,536