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 25, 2026 01:49Victor MerckléVictor MerckléScore: 63,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 25, 2026 01:5062,95930,766,42322,269,0001,026,0002,113,536
2Jun 25, 2026 01:5062,98331,192,39822,268,0001,036,0002,113,536
3Jun 25, 2026 01:5063,02130,787,16322,308,0001,010,0002,113,536
4Jun 25, 2026 01:5063,03231,017,25522,297,0001,025,0002,113,536
5Jun 25, 2026 01:5063,08930,819,41922,315,0001,028,0002,113,536
6Jun 25, 2026 01:5063,10530,808,94922,341,0001,008,0002,113,536
7Jun 25, 2026 01:5063,36232,333,77022,440,0001,004,0002,113,536
8Jun 25, 2026 01:5063,44831,590,61722,456,0001,020,0002,113,536
9Jun 25, 2026 01:5063,46431,468,28622,450,0001,032,0002,113,536