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 3, 2026 13:24IlyaIlyaScore: 59,175Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 13:2858,86231,284,57420,674,0001,105,0002,113,536
2Jul 3, 2026 13:2858,93531,280,78820,677,0001,129,0002,113,536
3Jul 3, 2026 13:2859,04831,334,17620,731,0001,117,0002,113,536
4Jul 3, 2026 13:2859,15631,386,63320,706,0001,182,0002,113,536
5Jul 3, 2026 13:2859,17531,361,69620,787,0001,108,0002,113,536
6Jul 3, 2026 13:2859,23531,908,68020,710,0001,207,0002,113,536
7Jul 3, 2026 13:2859,32131,922,74720,741,0001,208,0002,113,536
8Jul 3, 2026 13:2859,59431,877,78620,850,0001,200,0002,113,536
9Jul 3, 2026 13:2859,65631,706,50320,840,0001,233,0002,113,536