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 listJun 10, 2026 12:50Victor MerckléVictor MerckléScore: 64,232Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 12:5163,53532,555,31922,396,0001,112,0002,117,632stderr
2Jun 10, 2026 12:5163,72732,913,15722,441,0001,138,0002,117,632stderr
3Jun 10, 2026 12:5163,92932,716,54422,534,0001,120,0002,117,632stderr
4Jun 10, 2026 12:5164,12432,848,93722,613,0001,113,0002,117,632stderr
5Jun 10, 2026 12:5164,23232,865,69622,658,0001,108,0002,117,632stderr
6Jun 10, 2026 12:5164,37033,224,64922,697,0001,120,0002,117,632stderr
7Jun 10, 2026 12:5164,55933,129,37522,770,0001,117,0002,117,632stderr
8Jun 10, 2026 12:5164,72932,982,10422,828,0001,122,0002,117,632stderr
9Jun 10, 2026 12:5164,78933,039,47622,841,0001,131,0002,117,632stderr