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 21:27Victor MerckléVictor MerckléScore: 71,867Success
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 21:2771,67035,634,95325,226,0001,292,0002,113,536
2Jun 24, 2026 21:2771,68135,620,09425,229,0001,293,0002,113,536
3Jun 24, 2026 21:2771,74835,684,21325,523,0001,024,0002,113,536
4Jun 24, 2026 21:2771,78635,632,06125,284,0001,277,0002,113,536
5Jun 24, 2026 21:2771,86736,923,22425,564,0001,027,0002,113,536
6Jun 24, 2026 21:2771,98935,777,77025,338,0001,298,0002,113,536
7Jun 24, 2026 21:2772,01035,738,82425,348,0001,296,0002,113,536
8Jun 24, 2026 21:2772,06235,769,98025,367,0001,296,0002,113,536
9Jun 24, 2026 21:2772,07235,704,19825,382,0001,285,0002,113,536