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 15:48IlyaIlyaScore: 60,524Success
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 15:4959,68131,536,86120,971,0001,111,0002,113,536
2Jun 30, 2026 15:4959,90832,091,30520,962,0001,204,0002,113,536
3Jun 30, 2026 15:4959,94031,763,37721,034,0001,144,0002,113,536
4Jun 30, 2026 15:4960,30231,768,57921,224,0001,088,0002,113,536
5Jun 30, 2026 15:4960,52432,237,98021,177,0001,217,0002,113,536
6Jun 30, 2026 15:4960,57831,947,43021,385,0001,029,0002,113,536
7Jun 30, 2026 15:4960,82131,980,97721,385,0001,119,0002,113,536
8Jun 30, 2026 15:4960,83531,976,73621,400,0001,109,0002,113,536
9Jun 30, 2026 15:4965,06446,263,12323,013,0001,061,0002,117,632