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 listJul 3, 2026 22:28Victor MerckléVictor MerckléScore: 56,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 22:3256,78128,746,07321,009,00002,113,536
2Jul 3, 2026 22:3256,80029,444,94819,995,0001,021,0002,113,536
3Jul 3, 2026 22:3256,81028,797,33619,987,0001,033,0002,113,536
4Jul 3, 2026 22:3256,87228,786,76520,014,0001,029,0002,113,536
5Jul 3, 2026 22:3256,87828,949,14720,035,0001,010,0002,113,536
6Jul 3, 2026 22:3257,02728,844,90520,057,0001,043,0002,113,536
7Jul 3, 2026 22:3257,02728,865,25820,062,0001,038,0002,113,536
8Jul 3, 2026 22:3257,05929,200,39720,106,0001,006,0002,113,536
9Jul 3, 2026 22:32144,46261,580,89352,411,0001,040,0002,113,536