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 15:50IlyaIlyaScore: 60,878Success
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 15:5260,37031,837,72521,226,0001,111,0002,113,536
2Jun 30, 2026 15:5260,58331,920,35121,285,0001,131,0002,113,536
3Jun 30, 2026 15:5260,68932,009,07421,258,0001,197,0002,113,536
4Jun 30, 2026 15:5260,81632,383,35921,286,0001,216,0002,113,536
5Jun 30, 2026 15:5260,87832,426,39221,323,0001,202,0002,113,536
6Jun 30, 2026 15:5221,061,5107,802,866,3097,634,560,000158,199,0002,113,536
7Jun 30, 2026 15:5221,081,7727,810,274,5317,643,921,000156,335,0002,113,536
8Jun 30, 2026 15:5221,140,7947,832,040,9777,664,900,000157,194,0002,113,536
9Jun 30, 2026 15:5221,165,7547,841,615,8037,676,299,000155,030,0002,113,536