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 24, 2026 20:19Victor MerckléVictor MerckléScore: 70,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 20:2070,14835,038,06624,687,0001,268,0002,113,536
2Jun 24, 2026 20:2070,15635,067,06224,693,0001,265,0002,113,536
3Jun 24, 2026 20:2070,23235,123,75724,711,0001,275,0002,113,536
4Jun 24, 2026 20:2070,33235,173,82724,753,0001,270,0002,113,536
5Jun 24, 2026 20:2070,33535,500,29624,752,0001,272,0002,113,536
6Jun 24, 2026 20:2070,37535,524,08424,776,0001,263,0002,113,536
7Jun 24, 2026 20:2070,50535,150,09224,805,0001,282,0002,113,536
8Jun 24, 2026 20:2070,57837,339,18624,829,0001,285,0002,113,536
9Jun 24, 2026 20:2070,63235,253,39525,113,0001,021,0002,113,536