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 22:50IlyaIlyaScore: 58,724Success
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 22:5258,40831,255,19920,507,0001,104,0002,113,536
2Jul 8, 2026 22:5258,51831,340,75720,536,0001,116,0002,113,536
3Jul 8, 2026 22:5258,56731,402,01420,553,0001,117,0002,113,536
4Jul 8, 2026 22:5258,59131,386,08620,470,0001,209,0002,113,536
5Jul 8, 2026 22:5258,72431,458,32720,525,0001,203,0002,113,536
6Jul 8, 2026 22:5259,21832,605,15820,871,0001,040,0002,113,536
7Jul 8, 2026 22:5221,457,4087,949,224,8267,786,618,000152,623,0002,113,536
8Jul 8, 2026 22:5221,468,7517,954,356,1847,790,293,000153,145,0002,113,536
9Jul 8, 2026 22:5221,528,6247,976,020,2697,815,696,000149,895,0002,113,536