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 30, 2026 18:00IlyaIlyaScore: 58,994Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 18:0258,74531,141,79320,642,0001,094,0002,113,536
2Jun 30, 2026 18:0258,85631,195,78520,699,0001,078,0002,113,536
3Jun 30, 2026 18:0258,92131,301,40620,679,0001,122,0002,113,536
4Jun 30, 2026 18:0258,96731,324,34620,700,0001,118,0002,113,536
5Jun 30, 2026 18:0258,99431,356,26420,685,0001,143,0002,113,536
6Jun 30, 2026 18:0259,13531,831,24620,694,0001,186,0002,113,536
7Jun 30, 2026 18:0259,28131,470,29220,900,0001,034,0002,113,536
8Jun 30, 2026 18:0259,40831,461,06320,904,0001,077,0002,113,536
9Jun 30, 2026 18:0259,57031,613,17720,961,0001,080,0002,113,536