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 listJul 8, 2026 23:03IlyaIlyaScore: 58,667Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 23:0458,23231,193,30520,442,0001,104,0002,113,536
2Jul 8, 2026 23:0458,24331,252,00020,445,0001,105,0002,113,536
3Jul 8, 2026 23:0458,51331,315,03220,506,0001,144,0002,113,536
4Jul 8, 2026 23:0458,61831,397,12120,492,0001,197,0002,113,536
5Jul 8, 2026 23:0458,66731,437,61520,481,0001,226,0002,113,536
6Jul 8, 2026 23:0458,81833,045,19820,509,0001,254,0002,113,536
7Jul 8, 2026 23:0458,82931,437,44620,525,0001,242,0002,113,536
8Jul 8, 2026 23:0460,60542,730,59021,265,0001,159,0002,113,536
9Jul 8, 2026 23:0421,582,0487,995,268,1357,837,371,000147,987,0002,113,536