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 listMay 11, 2026 15:10Victor MerckléVictor MerckléScore: 71,018Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 15:1170,82436,811,93924,985,0001,220,0002,113,536
2May 11, 2026 15:1170,85934,966,40825,042,0001,176,0002,113,536
3May 11, 2026 15:1170,86735,741,91225,008,0001,213,0002,113,536
4May 11, 2026 15:1170,94836,436,39225,036,0001,215,0002,113,536
5May 11, 2026 15:1171,01835,048,26925,053,0001,224,0002,113,536
6May 11, 2026 15:1171,07035,861,21625,052,0001,244,0002,113,536
7May 11, 2026 15:1171,21335,039,96425,194,0001,155,0002,113,536
8May 11, 2026 15:1171,26736,469,84225,130,0001,239,0002,113,536
9May 11, 2026 15:1171,28335,465,11725,150,0001,225,0002,113,536