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 21:00IlyaIlyaScore: 59,210Success
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 21:0158,92931,158,46420,700,0001,104,0002,113,536
2Jun 29, 2026 21:0158,93531,237,95220,706,0001,100,0002,113,536
3Jun 29, 2026 21:0158,97831,325,57820,699,0001,123,0002,113,536
4Jun 29, 2026 21:0159,04031,312,03720,719,0001,126,0002,113,536
5Jun 29, 2026 21:0159,21031,378,68720,756,0001,152,0002,113,536
6Jun 29, 2026 21:0159,23531,430,59620,785,0001,132,0002,113,536
7Jun 29, 2026 21:0159,27531,868,86020,704,0001,228,0002,113,536
8Jun 29, 2026 21:0159,31631,394,25420,765,0001,182,0002,113,536
9Jun 29, 2026 21:0159,54331,945,31020,824,0001,207,0002,113,536