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 29, 2026 19:42IlyaIlyaScore: 59,824Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 19:4359,60231,465,31920,939,0001,114,0002,113,536
2Jun 29, 2026 19:4359,65631,470,00520,959,0001,114,0002,113,536
3Jun 29, 2026 19:4359,74831,566,19820,916,0001,191,0002,113,536
4Jun 29, 2026 19:4359,75432,119,56420,956,0001,153,0002,113,536
5Jun 29, 2026 19:4359,82431,693,11521,004,0001,131,0002,113,536
6Jun 29, 2026 19:4359,88932,037,88521,032,0001,127,0002,113,536
7Jun 29, 2026 19:4360,01632,041,54020,994,0001,212,0002,113,536
8Jun 29, 2026 19:4360,01832,117,60121,011,0001,196,0002,113,536
9Jun 29, 2026 19:4360,10032,249,51521,020,0001,217,0002,113,536