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 listMar 20, 2026 20:00olliecrowolliecrowScore: 102,246Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 20:05100,71158,416,67435,249,0002,014,0002,428,928
2Mar 20, 2026 20:04100,93262,260,49834,317,0003,028,0002,433,024
3Mar 20, 2026 20:05101,25761,388,98236,453,0001,012,0002,342,912
4Mar 20, 2026 20:04101,61169,698,69936,580,0001,016,0002,342,912
5Mar 20, 2026 20:00101,80366,794,31735,631,0002,036,0002,342,912
6Mar 20, 2026 20:04102,20868,336,09435,827,0001,990,0002,437,120
7Mar 20, 2026 20:04102,24663,630,52435,840,0001,991,0002,433,024
8Mar 20, 2026 20:00102,47364,842,45434,922,0002,993,0002,433,024
9Mar 20, 2026 20:05102,61460,918,16335,969,0001,998,0002,326,528
10Mar 20, 2026 20:04102,63565,306,31235,977,0001,998,0002,342,912
11Mar 20, 2026 20:04102,72762,940,10836,009,0002,000,0002,437,120
12Mar 20, 2026 20:00103,15765,626,17936,160,0002,008,0002,342,912