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 listSep 16, 2023 16:16mmalczakmmalczakScore: 98,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2023 16:1697,54658,677,73134,087,0002,005,0002,289,664
2Sep 16, 2023 16:1698,06561,492,25734,269,0002,015,0002,289,664
3Sep 16, 2023 16:1698,22758,510,51234,325,0002,019,0002,355,200
4Sep 16, 2023 16:1698,23258,396,29535,337,0001,009,0002,289,664
5Sep 16, 2023 16:1698,26562,173,50136,358,00002,289,664
6Sep 16, 2023 16:1698,31159,978,88434,355,0002,020,0002,289,664
7Sep 16, 2023 16:1698,73559,942,91036,532,00002,281,472
8Sep 16, 2023 16:1699,54592,557,82436,831,71102,269,184
9Sep 16, 2023 16:1699,62460,145,57234,869,0001,992,0002,273,280
10Sep 16, 2023 16:16100,42764,145,03235,150,0002,008,0002,289,664
11Sep 16, 2023 16:16100,44598,102,58537,164,70802,269,184
12Sep 16, 2023 16:16100,52094,778,06037,192,39702,260,992