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 09:43Victor MerckléVictor MerckléScore: 64,002Success
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 09:4462,82730,652,18722,220,0001,026,0002,113,536
2Jun 24, 2026 09:4463,21630,842,42922,349,0001,041,0002,113,536
3Jun 24, 2026 09:4463,37030,889,33622,394,0001,053,0002,113,536
4Jun 24, 2026 09:4463,78931,641,66122,540,0001,062,0002,113,536
5Jun 24, 2026 09:4464,00231,515,44922,590,0001,091,0002,113,536
6Jun 24, 2026 09:4464,15131,179,30022,695,0001,041,0002,113,536
7Jun 24, 2026 09:4464,25431,786,10922,709,0001,065,0002,113,536
8Jun 24, 2026 09:4464,37031,254,25722,761,0001,056,0002,113,536
9Jun 24, 2026 09:4465,33731,779,58023,110,0001,065,0002,113,536