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 listJul 3, 2026 22:41Victor MerckléVictor MerckléScore: 79,097Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 22:4178,75936,867,12128,123,0001,018,0002,117,632stderr
2Jul 3, 2026 22:4178,79137,229,63129,153,00002,117,632stderr
3Jul 3, 2026 22:4178,90237,653,93428,145,0001,049,0002,117,632stderr
4Jul 3, 2026 22:4178,96237,260,19628,210,0001,006,0002,117,632stderr
5Jul 3, 2026 22:4179,09737,210,36228,224,0001,042,0002,117,632stderr
6Jul 3, 2026 22:4179,11337,470,81928,231,0001,041,0002,117,632stderr
7Jul 3, 2026 22:4179,19737,011,72128,272,0001,031,0002,117,632stderr
8Jul 3, 2026 22:4179,22937,711,42528,264,0001,051,0002,117,632stderr
9Jul 3, 2026 22:4179,46437,384,08528,386,0001,016,0002,117,632stderr