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:47M-RochatM-RochatScore: 59,751Success
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:4859,38133,172,92420,892,0001,079,0002,113,536
2May 21, 2026 18:4859,43234,132,14320,840,0001,150,0002,113,536
3May 21, 2026 18:4859,60034,132,86820,909,0001,143,0002,113,536
4May 21, 2026 18:4859,64833,657,46420,904,0001,166,0002,113,536
5May 21, 2026 18:4859,75132,727,73620,944,0001,164,0002,113,536
6May 21, 2026 18:4859,75631,564,07420,953,0001,157,0002,113,536
7May 21, 2026 18:4859,78332,318,78020,965,0001,155,0002,113,536
8May 21, 2026 18:4859,88135,297,97321,053,0001,103,0002,113,536
9May 21, 2026 18:4859,90033,063,68921,062,0001,101,0002,113,536