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:24mmalczakmmalczakScore: 84,259Success
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:2482,72457,676,43029,588,0001,020,0002,273,280
2Sep 20, 2023 19:2483,41158,083,53729,867,000995,0002,289,664
3Sep 20, 2023 19:2483,43256,518,91028,879,0001,991,0002,281,472
4Sep 20, 2023 19:2483,54654,756,05029,915,000997,0002,289,664
5Sep 20, 2023 19:2483,77853,260,69229,999,000999,0002,273,280
6Sep 20, 2023 19:2484,03052,735,03930,089,0001,002,0002,289,664
7Sep 20, 2023 19:2484,25954,097,67629,165,0002,011,0002,277,376
8Sep 20, 2023 19:2484,27656,968,34630,177,0001,005,0002,273,280
9Sep 20, 2023 19:2485,02455,355,69229,430,0002,029,0002,289,664
10Sep 20, 2023 19:2485,585105,644,70431,666,53602,265,088
11Sep 20, 2023 19:2486,00094,059,92231,819,90602,256,896
12Sep 20, 2023 19:2487,05296,522,72632,209,21302,265,088