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 12:09M-RochatM-RochatScore: 62,813Success
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 12:1062,60831,920,86922,018,0001,147,0002,113,536
2May 17, 2026 12:1062,69432,033,84622,033,0001,164,0002,113,536
3May 17, 2026 12:1062,72732,861,06422,063,0001,146,0002,117,632
4May 17, 2026 12:1062,78632,850,83822,066,0001,165,0002,113,536
5May 17, 2026 12:1062,81332,122,41022,056,0001,185,0002,113,536
6May 17, 2026 12:1062,86233,806,72222,049,0001,210,0002,113,536
7May 17, 2026 12:1062,96232,856,02922,090,0001,206,0002,113,536
8May 17, 2026 12:1062,96432,384,93222,126,0001,171,0002,113,536
9May 17, 2026 12:1063,00533,040,27722,154,0001,158,0002,113,536