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 listApr 21, 2026 16:30olliecrowolliecrowScore: 62,778Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 16:3162,45938,629,73920,096,0003,014,0002,502,656stderr
2Apr 21, 2026 16:3162,57042,120,75620,132,0003,019,0002,502,656stderr
3Apr 21, 2026 16:3162,61340,681,01920,146,0003,021,0002,506,752stderr
4Apr 21, 2026 16:3162,70840,388,80920,176,0003,026,0002,342,912stderr
5Apr 21, 2026 16:3162,77840,615,49920,199,0003,029,0002,519,040stderr
6Apr 21, 2026 16:3162,89140,968,83321,247,0002,023,0002,506,752stderr
7Apr 21, 2026 16:3162,92444,027,15920,246,0003,036,0002,510,848stderr
8Apr 21, 2026 16:3162,98336,588,73420,265,0003,039,0002,338,816stderr
9Apr 21, 2026 16:3163,21338,641,72720,339,0003,050,0002,306,048stderr