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 listApr 23, 2026 12:41Charles CabergsCharles CabergsScore: 70,848Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 12:4270,71645,697,10325,159,0001,006,0002,371,584
2Apr 23, 2026 12:4270,72743,157,22624,156,0002,013,0002,363,392
3Apr 23, 2026 12:4270,82140,457,41024,189,0002,015,0002,359,296
4Apr 23, 2026 12:4270,84344,229,10424,196,0002,016,0002,306,048
5Apr 23, 2026 12:4270,84843,676,93824,198,0002,016,0002,355,200
6Apr 23, 2026 12:4270,90844,189,11424,218,0002,018,0002,371,584
7Apr 23, 2026 12:4271,05445,723,01724,268,0002,022,0002,367,488
8Apr 23, 2026 12:4271,09145,534,26425,293,0001,011,0002,351,104
9Apr 23, 2026 12:4271,15149,303,35624,301,0002,025,0002,359,296