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:10mmalczakmmalczakScore: 99,608Success
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:1097,52454,696,13934,080,0002,004,0002,277,376
2Sep 16, 2023 16:1097,85962,743,26134,197,0002,011,0002,531,328
3Sep 16, 2023 16:1098,37662,654,07035,388,0001,011,0002,281,472
4Sep 16, 2023 16:1098,63064,791,32534,466,0002,027,0002,289,664
5Sep 16, 2023 16:1098,91962,624,30735,584,0001,016,0002,289,664
6Sep 16, 2023 16:1099,36195,742,96136,763,64702,269,184
7Sep 16, 2023 16:1099,60862,777,83135,859,000996,0002,269,184
8Sep 16, 2023 16:1099,62463,987,13134,869,0001,992,0002,531,328
9Sep 16, 2023 16:1099,62761,638,04334,870,0001,992,0002,269,184
10Sep 16, 2023 16:1099,67663,844,20835,884,000996,0002,527,232
11Sep 16, 2023 16:1099,788105,734,08136,921,54802,269,184
12Sep 16, 2023 16:10100,717100,946,63137,265,21102,260,992