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 13:19Victor MerckléVictor MerckléScore: 63,164Success
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 13:1962,57030,724,15323,151,00002,113,536
2Jun 10, 2026 13:1963,02130,710,15923,318,00002,113,536
3Jun 10, 2026 13:1963,10030,728,97222,330,0001,017,0002,113,536
4Jun 10, 2026 13:1963,15630,748,46523,368,00002,113,536
5Jun 10, 2026 13:1963,16430,702,25823,371,00002,113,536
6Jun 10, 2026 13:1963,30230,833,47823,422,00002,113,536
7Jun 10, 2026 13:1963,38331,042,44523,452,00002,113,536
8Jun 10, 2026 13:1963,58931,261,36123,528,00002,113,536
9Jun 10, 2026 13:1963,82431,542,46823,615,00002,113,536