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 02:40Victor MerckléVictor MerckléScore: 58,308Success
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 02:4158,20229,151,47120,496,0001,039,0002,113,536
2Jun 25, 2026 02:4158,20229,356,17120,500,0001,035,0002,113,536
3Jun 25, 2026 02:4158,22429,391,18420,532,0001,011,0002,113,536
4Jun 25, 2026 02:4158,26429,644,59220,516,0001,042,0002,113,536
5Jun 25, 2026 02:4158,30829,112,56820,550,0001,024,0002,113,536
6Jun 25, 2026 02:4158,39129,419,48320,573,0001,032,0002,113,536
7Jun 25, 2026 02:4158,41829,069,49420,584,0001,031,0002,113,536
8Jun 25, 2026 02:4158,42129,347,50220,613,0001,003,0002,113,536
9Jun 25, 2026 02:4158,57529,413,04420,657,0001,016,0002,113,536