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 17:56M-RochatM-RochatScore: 59,997Success
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 17:5759,65931,810,60020,975,0001,099,0002,113,536
2May 18, 2026 17:5759,89732,981,80921,014,0001,148,0002,113,536
3May 18, 2026 17:5759,93234,402,65521,149,0001,026,0002,113,536
4May 18, 2026 17:5759,93532,105,93221,165,0001,011,0002,113,536
5May 18, 2026 17:5759,99731,904,98421,050,0001,149,0002,113,536
6May 18, 2026 17:5760,13531,626,20721,070,0001,180,0002,113,536
7May 18, 2026 17:5760,16431,651,26821,084,0001,177,0002,113,536
8May 18, 2026 17:5760,17832,863,63721,162,0001,104,0002,113,536
9May 18, 2026 17:5760,22934,384,70721,273,0001,012,0002,113,536