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 16, 2023 16:00mmalczakmmalczakScore: 99,070Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2023 16:0097,56859,912,01335,098,0001,002,0002,289,664
2Sep 16, 2023 16:0097,58464,352,70034,101,0002,005,0002,289,664
3Sep 16, 2023 16:0097,63560,532,73435,122,0001,003,0002,277,376
4Sep 16, 2023 16:0097,93061,333,00234,221,0002,013,0002,289,664
5Sep 16, 2023 16:0098,20857,364,04034,319,0002,018,0002,289,664
6Sep 16, 2023 16:0098,24362,448,72134,331,0002,019,0002,289,664
7Sep 16, 2023 16:0099,07066,678,48434,675,0001,981,0002,265,088
8Sep 16, 2023 16:0099,53063,350,63135,831,000995,0002,289,664
9Sep 16, 2023 16:0099,547114,265,60636,832,47302,265,088
10Sep 16, 2023 16:0099,58966,672,47634,857,0001,991,0002,289,664
11Sep 16, 2023 16:0099,69292,979,66236,885,89702,277,376
12Sep 16, 2023 16:00100,818115,435,83637,302,66702,277,376