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:14IlyaIlyaScore: 60,143Success
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:1559,92131,628,70620,997,0001,174,0002,113,536
2Jun 30, 2026 22:1560,07832,181,20821,037,0001,192,0002,113,536
3Jun 30, 2026 22:1560,08331,693,49921,037,0001,194,0002,113,536
4Jun 30, 2026 22:1560,08331,772,91821,027,0001,204,0002,113,536
5Jun 30, 2026 22:1560,14332,178,40821,063,0001,190,0002,113,536
6Jun 30, 2026 22:1560,17031,748,43521,142,0001,121,0002,113,536
7Jun 30, 2026 22:1560,30031,762,56321,112,0001,199,0002,113,536
8Jun 30, 2026 22:1560,41632,240,94721,147,0001,207,0002,113,536
9Jun 30, 2026 22:1564,91843,600,62022,738,0001,282,0002,117,632