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 5, 2026 13:35Victor MerckléVictor MerckléScore: 64,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 13:3664,10832,828,89422,678,0001,042,0002,113,536
2Jun 5, 2026 13:3664,16732,902,42022,681,0001,061,0002,113,536
3Jun 5, 2026 13:3664,33532,882,40422,679,0001,125,0002,113,536
4Jun 5, 2026 13:3664,51032,960,15522,729,0001,140,0002,113,536
5Jun 5, 2026 13:3664,53232,999,63222,745,0001,132,0002,113,536
6Jun 5, 2026 13:3664,55932,996,11722,749,0001,138,0002,113,536
7Jun 5, 2026 13:3664,90033,167,49422,876,0001,137,0002,113,536
8Jun 5, 2026 13:3664,93733,148,33422,874,0001,153,0002,113,536
9Jun 5, 2026 13:3664,94533,105,50622,874,0001,156,0002,113,536