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 11, 2026 09:31Victor MerckléVictor MerckléScore: 90,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 09:3287,16239,614,32925,195,0007,055,0002,117,632
2Jun 11, 2026 09:3288,16239,973,21125,397,0007,223,0002,113,536
3Jun 11, 2026 09:3288,72440,281,88826,075,0006,753,0002,113,536
4Jun 11, 2026 09:3289,75940,660,36826,197,0007,014,0002,113,536
5Jun 11, 2026 09:3290,17040,779,20226,234,0007,129,0002,113,536
6Jun 11, 2026 09:3290,24340,851,63326,280,0007,110,0002,113,536
7Jun 11, 2026 09:3290,43541,060,75026,529,0006,932,0002,113,536
8Jun 11, 2026 09:3290,99741,054,62726,141,0007,528,0002,113,536
9Jun 11, 2026 09:3291,92141,704,27926,186,0007,825,0002,113,536