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 listAug 27, 2026 12:03C#_userC#_userScore: 159,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 12:07159,68168,786,74957,956,0001,126,0002,142,208
2Aug 27, 2026 12:07159,70068,735,63557,971,0001,118,0002,142,208
3Aug 27, 2026 12:07159,70568,855,67357,964,0001,127,0002,142,208
4Aug 27, 2026 12:07159,73268,766,25956,958,0002,143,0002,203,648
5Aug 27, 2026 12:07159,84368,772,93458,020,0001,122,0002,142,208
6Aug 27, 2026 12:07159,91369,235,02458,058,0001,110,0002,142,208
7Aug 27, 2026 12:07159,97068,898,62558,073,0001,116,0002,142,208
8Aug 27, 2026 12:07160,04568,927,82758,103,0001,114,0002,203,648
9Aug 27, 2026 12:07160,33569,341,04258,217,0001,107,0002,142,208