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 23:13olliecrowolliecrowScore: 102,476Success
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 23:16101,26862,073,18736,457,0001,012,0002,400,256
2Mar 20, 2026 23:18101,80070,231,32335,630,0002,036,0002,342,912
3Mar 20, 2026 23:15101,83566,774,41135,643,0002,036,0002,416,640
4Mar 20, 2026 23:13102,26864,595,76336,844,000995,0002,416,640
5Mar 20, 2026 23:15102,35169,344,18734,881,0002,989,0002,342,912
6Mar 20, 2026 23:16102,39558,435,61134,895,0002,991,0002,408,448
7Mar 20, 2026 23:18102,47664,505,54334,923,0002,993,0002,412,544
8Mar 20, 2026 23:13102,51462,414,46235,934,0001,996,0002,404,352
9Mar 20, 2026 23:15102,63266,896,31234,976,0002,998,0002,412,544
10Mar 20, 2026 23:13103,13569,158,11635,148,0003,012,0002,416,640
11Mar 20, 2026 23:16103,20871,708,60835,173,0003,014,0002,342,912
12Mar 20, 2026 23:18103,33260,224,17037,227,0001,006,0002,535,424