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 12, 2026 19:01IlyaIlyaScore: 58,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 19:0358,34831,207,40920,490,0001,099,0002,113,536
2Jul 12, 2026 19:0358,41631,288,51220,459,0001,155,0002,113,536
3Jul 12, 2026 19:0358,44331,259,42920,512,0001,112,0002,113,536
4Jul 12, 2026 19:0358,50531,377,56020,440,0001,207,0002,113,536
5Jul 12, 2026 19:0358,54531,641,58720,475,0001,187,0002,113,536
6Jul 12, 2026 19:0358,58131,320,83720,560,0001,115,0002,113,536
7Jul 12, 2026 19:0358,83231,999,39120,568,0001,200,0002,113,536
8Jul 12, 2026 19:0321,414,4377,933,701,3687,770,870,000152,472,0002,113,536
9Jul 12, 2026 19:0321,460,9167,950,295,3687,790,486,000150,053,0002,113,536