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 30, 2026 22:37IlyaIlyaScore: 59,981Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 22:3859,82731,668,14621,027,0001,109,0002,113,536
2Jun 30, 2026 22:3859,85432,059,80520,943,0001,203,0002,113,536
3Jun 30, 2026 22:3859,87832,069,44820,946,0001,209,0002,113,536
4Jun 30, 2026 22:3859,91832,069,12620,971,0001,199,0002,113,536
5Jun 30, 2026 22:3859,98132,066,20020,994,0001,199,0002,113,536
6Jun 30, 2026 22:3860,02932,204,48420,996,0001,215,0002,113,536
7Jun 30, 2026 22:3860,03532,079,14421,006,0001,207,0002,113,536
8Jun 30, 2026 22:3860,04832,188,43620,964,0001,254,0002,113,536
9Jun 30, 2026 22:3860,36236,459,88521,305,0001,029,0002,113,536