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 listAug 14, 2026 22:18Tomislav TunkovicTomislav TunkovicScore: 57,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 22:2057,51029,677,16421,279,00002,113,536
2Aug 14, 2026 22:2057,56229,708,19821,298,00002,113,536
3Aug 14, 2026 22:2057,56729,658,93920,272,0001,028,0002,113,536
4Aug 14, 2026 22:2057,61829,740,51120,318,0001,001,0002,113,536
5Aug 14, 2026 22:2057,63229,756,53820,316,0001,008,0002,113,536
6Aug 14, 2026 22:2057,66729,714,26520,301,0001,036,0002,113,536
7Aug 14, 2026 22:2057,75429,734,46120,325,0001,044,0002,113,536
8Aug 14, 2026 22:2057,80229,786,34420,379,0001,008,0002,113,536
9Aug 14, 2026 22:2057,90529,825,21420,420,0001,005,0002,113,536