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 listAug 14, 2026 22:09Tomislav TunkovicTomislav TunkovicScore: 228,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 22:10227,97892,734,82783,319,0001,033,0002,117,632stderr
2Aug 14, 2026 22:10228,01392,705,72083,355,0001,010,0002,117,632stderr
3Aug 14, 2026 22:10228,27292,824,07783,423,0001,038,0002,117,632stderr
4Aug 14, 2026 22:10228,49192,940,04583,477,0001,065,0002,117,632stderr
5Aug 14, 2026 22:10228,50092,900,93483,478,0001,067,0002,117,632stderr
6Aug 14, 2026 22:10228,67093,013,86283,543,0001,065,0002,117,632stderr
7Aug 14, 2026 22:10228,75493,055,30583,628,0001,011,0002,117,632stderr
8Aug 14, 2026 22:10229,32493,308,55083,838,0001,012,0002,117,632stderr
9Aug 14, 2026 22:10229,71093,504,99983,983,0001,010,0002,117,632stderr