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 17, 2026 23:51M-RochatM-RochatScore: 61,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 23:5361,23531,834,48521,514,0001,143,0002,113,536
2May 17, 2026 23:5361,43732,902,84221,580,0001,152,0002,113,536
3May 17, 2026 23:5361,46733,837,80121,602,0001,141,0002,113,536
4May 17, 2026 23:5361,48933,760,61921,585,0001,166,0002,113,536
5May 17, 2026 23:5361,58933,729,71921,627,0001,161,0002,113,536
6May 17, 2026 23:5361,63232,018,07621,636,0001,168,0002,113,536
7May 17, 2026 23:5361,73234,891,61921,683,0001,158,0002,113,536
8May 17, 2026 23:5361,74333,073,14321,684,0001,161,0002,113,536
9May 17, 2026 23:5361,91832,047,40421,762,0001,148,0002,113,536