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 21, 2023 19:06mmalczakmmalczakScore: 84,465Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2023 19:0683,23259,643,90928,810,0001,986,0002,289,664
2Sep 21, 2023 19:0683,36559,198,03028,855,0001,990,0002,289,664
3Sep 21, 2023 19:0683,66853,817,30229,959,000998,0002,289,664
4Sep 21, 2023 19:0683,75453,478,49028,990,0001,999,0002,273,280
5Sep 21, 2023 19:0683,84960,205,84929,023,0002,001,0002,289,664
6Sep 21, 2023 19:0683,85754,168,33730,027,0001,000,0002,277,376
7Sep 21, 2023 19:0684,46560,028,88330,244,0001,008,0002,289,664
8Sep 21, 2023 19:0684,60057,838,49030,293,0001,009,0002,289,664
9Sep 21, 2023 19:0685,15455,684,37330,491,0001,016,0002,269,184
10Sep 21, 2023 19:0685,807103,195,48531,748,66902,265,088
11Sep 21, 2023 19:0686,626105,580,02532,051,58002,265,088
12Sep 21, 2023 19:0691,054111,730,33533,689,88002,265,088