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 10, 2026 12:40Victor MerckléVictor MerckléScore: 65,016Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 12:4164,53232,855,03322,772,0001,105,0002,117,632stderr
2Jun 10, 2026 12:4164,68332,927,42622,800,0001,133,0002,117,632stderr
3Jun 10, 2026 12:4164,86433,070,32122,888,0001,112,0002,117,632stderr
4Jun 10, 2026 12:4164,88933,080,14522,871,0001,138,0002,117,632stderr
5Jun 10, 2026 12:4165,01633,063,57122,956,0001,100,0002,117,632stderr
6Jun 10, 2026 12:4165,07533,128,52422,955,0001,123,0002,117,632stderr
7Jun 10, 2026 12:4165,18633,081,05623,007,0001,112,0002,117,632stderr
8Jun 10, 2026 12:4165,39133,198,89223,091,0001,104,0002,117,632stderr
9Jun 10, 2026 12:4165,46234,606,00523,093,0001,128,0002,117,632stderr