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 19, 2023 07:38mmalczakmmalczakScore: 84,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2023 07:3882,98654,371,58929,682,0001,023,0002,289,664
2Sep 19, 2023 07:3883,31658,654,85928,839,0001,988,0002,289,664
3Sep 19, 2023 07:3883,35759,382,89630,842,00002,289,664
4Sep 19, 2023 07:3883,46861,862,32628,891,0001,992,0002,523,136
5Sep 19, 2023 07:3883,67053,343,31929,960,000998,0002,273,280
6Sep 19, 2023 07:3884,18455,295,60729,139,0002,009,0002,273,280
7Sep 19, 2023 07:3884,23054,849,11329,155,0002,010,0002,289,664
8Sep 19, 2023 07:3884,24660,034,68129,160,0002,011,0002,289,664
9Sep 19, 2023 07:3884,27358,242,64129,170,0002,011,0002,273,280
10Sep 19, 2023 07:3885,525104,710,26931,644,15302,256,896
11Sep 19, 2023 07:3885,749103,074,21731,727,09702,256,896
12Sep 19, 2023 07:3886,09199,614,92131,853,78802,265,088