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 24, 2026 23:33Victor MerckléVictor MerckléScore: 59,089Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 23:3458,83229,409,42520,738,0001,030,0002,113,536
2Jun 24, 2026 23:3458,88129,202,19620,762,0001,024,0002,113,536
3Jun 24, 2026 23:3459,00829,348,24520,811,0001,022,0002,113,536
4Jun 24, 2026 23:3459,08329,936,16520,842,0001,019,0002,113,536
5Jun 24, 2026 23:3459,08929,951,29320,861,0001,002,0002,113,536
6Jun 24, 2026 23:3459,22129,990,80520,904,0001,008,0002,113,536
7Jun 24, 2026 23:3459,22130,916,23420,901,0001,011,0002,113,536
8Jun 24, 2026 23:3459,28329,637,75520,874,0001,061,0002,113,536
9Jun 24, 2026 23:3459,62129,549,24420,971,0001,089,0002,113,536