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 07:24Victor MerckléVictor MerckléScore: 57,048Success
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 07:2556,88928,836,13120,024,0001,025,0002,113,536
2Jun 25, 2026 07:2556,94328,655,32520,061,0001,008,0002,113,536
3Jun 25, 2026 07:2557,03228,582,51320,084,0001,018,0002,113,536
4Jun 25, 2026 07:2557,03528,771,38920,097,0001,006,0002,113,536
5Jun 25, 2026 07:2557,04828,761,76820,090,0001,018,0002,113,536
6Jun 25, 2026 07:2557,05929,173,02720,089,0001,023,0002,113,536
7Jun 25, 2026 07:2557,12129,217,18220,130,0001,005,0002,113,536
8Jun 25, 2026 07:2557,15928,716,55020,107,0001,042,0002,113,536
9Jun 25, 2026 07:2557,19128,612,51620,158,0001,003,0002,113,536