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:39mmalczakmmalczakScore: 84,335Success
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:3982,63054,197,30229,554,0001,019,0002,531,328
2Sep 19, 2023 07:3982,71156,659,21829,583,0001,020,0002,285,568
3Sep 19, 2023 07:3982,84358,006,05729,631,0001,021,0002,285,568
4Sep 19, 2023 07:3983,36556,906,56328,855,0001,990,0002,531,328
5Sep 19, 2023 07:3983,40556,571,61028,869,0001,991,0002,527,232
6Sep 19, 2023 07:3983,84359,612,39429,021,0002,001,0002,285,568
7Sep 19, 2023 07:3984,33556,046,04729,191,0002,013,0002,285,568
8Sep 19, 2023 07:3984,63853,606,89130,306,0001,010,0002,269,184
9Sep 19, 2023 07:3984,65453,386,00630,312,0001,010,0002,281,472
10Sep 19, 2023 07:3985,770101,729,10631,734,86502,252,800
11Sep 19, 2023 07:3986,03988,480,85331,834,31702,252,800
12Sep 19, 2023 07:3986,391110,326,64431,964,73802,260,992