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 20, 2023 19:22mmalczakmmalczakScore: 83,870Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2023 19:2282,75759,722,18729,600,0001,020,0002,289,664
2Sep 20, 2023 19:2282,79257,333,12029,612,0001,021,0002,277,376
3Sep 20, 2023 19:2283,31155,608,19330,825,00002,289,664
4Sep 20, 2023 19:2283,44961,390,26228,884,0001,992,0002,289,664
5Sep 20, 2023 19:2283,62258,194,39129,942,000998,0002,531,328
6Sep 20, 2023 19:2283,65753,583,88328,956,0001,997,0002,289,664
7Sep 20, 2023 19:2283,87059,219,22329,030,0002,002,0002,527,232
8Sep 20, 2023 19:2284,09262,691,28630,111,0001,003,0002,289,664
9Sep 20, 2023 19:2284,38454,861,41329,208,0002,014,0002,269,184
10Sep 20, 2023 19:2285,563103,160,99731,658,36802,265,088
11Sep 20, 2023 19:2285,82996,148,46431,756,64702,269,184
12Sep 20, 2023 19:2286,03892,295,70131,833,93002,273,280