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 10:51Victor MerckléVictor MerckléScore: 63,883Success
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 10:5263,69131,059,13923,566,00002,113,536
2Jun 24, 2026 10:5263,74831,641,33122,586,0001,001,0002,113,536
3Jun 24, 2026 10:5263,75431,481,32223,589,00002,113,536
4Jun 24, 2026 10:5263,84031,188,73922,615,0001,006,0002,113,536
5Jun 24, 2026 10:5263,88331,650,12123,637,00002,113,536
6Jun 24, 2026 10:5263,99431,212,69022,674,0001,004,0002,113,536
7Jun 24, 2026 10:5264,07531,392,22023,708,00002,113,536
8Jun 24, 2026 10:5264,30031,703,33823,791,00002,113,536
9Jun 24, 2026 10:5264,84031,477,26323,991,00002,113,536