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 16:26mmalczakmmalczakScore: 84,076Success
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 16:2682,63051,714,38929,554,0001,019,0002,289,664
2Sep 20, 2023 16:2683,45956,797,70328,888,0001,992,0002,289,664
3Sep 20, 2023 16:2683,53057,807,94029,876,0001,030,0002,273,280
4Sep 20, 2023 16:2683,63052,515,14129,945,000998,0002,289,664
5Sep 20, 2023 16:2683,84359,572,65330,022,0001,000,0002,277,376
6Sep 20, 2023 16:2683,85757,546,75329,026,0002,001,0002,289,664
7Sep 20, 2023 16:2684,07654,972,78830,105,0001,003,0002,289,664
8Sep 20, 2023 16:2684,28159,854,32830,179,0001,005,0002,273,280
9Sep 20, 2023 16:2684,81451,444,38929,357,0002,024,0002,527,232
10Sep 20, 2023 16:2685,63793,296,11831,685,65802,265,088
11Sep 20, 2023 16:2686,23498,258,28231,906,65302,269,184
12Sep 20, 2023 16:2686,394108,175,11431,965,67102,277,376