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 18:58IlyaIlyaScore: 58,510Success
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:0058,29131,320,91620,428,0001,140,0002,113,536
2Jul 12, 2026 19:0058,37031,271,12120,477,0001,120,0002,113,536
3Jul 12, 2026 19:0058,37831,323,14820,485,0001,115,0002,113,536
4Jul 12, 2026 19:0058,50031,263,09920,512,0001,133,0002,113,536
5Jul 12, 2026 19:0058,51031,259,66420,521,0001,128,0002,113,536
6Jul 12, 2026 19:0058,54331,923,79620,487,0001,174,0002,113,536
7Jul 12, 2026 19:0058,74031,934,16620,523,0001,211,0002,113,536
8Jul 12, 2026 19:0021,516,9627,971,131,6637,808,760,000152,516,0002,113,536
9Jul 12, 2026 19:0021,573,9057,992,698,2747,832,486,000149,859,0002,113,536