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 10:16Victor MerckléVictor MerckléScore: 57,062Success
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 10:1656,89429,106,38520,019,0001,032,0002,113,536
2Jun 25, 2026 10:1656,91828,596,02620,031,0001,029,0002,113,536
3Jun 25, 2026 10:1657,00228,927,73120,072,0001,019,0002,113,536
4Jun 25, 2026 10:1657,04028,574,12120,084,0001,021,0002,113,536
5Jun 25, 2026 10:1657,06228,655,97820,104,0001,009,0002,113,536
6Jun 25, 2026 10:1657,13728,921,77920,133,0001,008,0002,113,536
7Jun 25, 2026 10:1657,15429,177,01020,105,0001,042,0002,113,536
8Jun 25, 2026 10:16144,19160,782,10352,335,0001,016,0002,113,536
9Jun 25, 2026 10:16145,40861,451,34752,772,0001,029,0002,113,536