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 31, 2026 12:24Victor MerckléVictor MerckléScore: 58,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 12:2658,10829,725,65820,410,0001,090,0002,117,632stderr
2Aug 31, 2026 12:2658,16430,578,83220,407,0001,114,0002,117,632stderr
3Aug 31, 2026 12:2658,20829,721,28820,442,0001,095,0002,117,632stderr
4Aug 31, 2026 12:2658,23530,507,54320,448,0001,099,0002,117,632stderr
5Aug 31, 2026 12:2658,27830,557,05420,460,0001,103,0002,117,632stderr
6Aug 31, 2026 12:2658,31329,772,21920,476,0001,100,0002,117,632stderr
7Aug 31, 2026 12:2658,33529,904,81820,484,0001,100,0002,117,632stderr
8Aug 31, 2026 12:2658,33529,769,39520,437,0001,147,0002,117,632stderr
9Aug 31, 2026 12:2658,47530,754,00920,483,0001,153,0002,117,632stderr