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 18:33olliecrowolliecrowScore: 101,873Success
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 18:36101,40864,314,76336,507,0001,014,0002,342,912
2Mar 20, 2026 18:33101,47663,810,82535,517,0002,029,0002,330,624
3Mar 20, 2026 18:34101,47660,603,28136,532,0001,014,0002,330,624
4Mar 20, 2026 18:36101,72763,281,78636,622,0001,017,0002,342,912
5Mar 20, 2026 18:35101,84365,727,63435,646,0002,036,0002,342,912
6Mar 20, 2026 18:36101,85963,678,05936,670,0001,018,0002,342,912
7Mar 20, 2026 18:34101,87361,159,62035,656,0002,037,0002,441,216
8Mar 20, 2026 18:35102,23067,688,81734,839,0002,986,0002,441,216
9Mar 20, 2026 18:35102,38464,926,14834,892,0002,990,0002,330,624
10Mar 20, 2026 18:34102,47071,381,55434,921,0002,993,0002,441,216
11Mar 20, 2026 18:33103,03867,173,14835,115,0003,009,0002,330,624
12Mar 20, 2026 18:33105,03268,367,39835,873,0002,989,0002,445,312