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 listFeb 15, 2023 17:06LiamLiamScore: 99,919Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2023 17:0698,50558,377,54936,447,00002,281,472
2Feb 15, 2023 17:0699,08463,789,12836,661,00002,269,184
3Feb 15, 2023 17:0699,57671,485,48135,848,000995,0002,289,664
4Feb 15, 2023 17:0699,64364,765,21535,844,0001,024,0002,289,664
5Feb 15, 2023 17:0699,80361,059,63934,931,0001,996,0002,375,680
6Feb 15, 2023 17:0699,83259,540,23534,942,0001,996,0002,289,664
7Feb 15, 2023 17:0699,91960,419,77034,972,0001,998,0002,289,664
8Feb 15, 2023 17:0699,98965,681,64834,997,0001,999,0002,289,664
9Feb 15, 2023 17:06100,71164,455,69935,249,0002,014,0002,289,664
10Feb 15, 2023 17:06101,053103,063,87137,389,63202,273,280
11Feb 15, 2023 17:06101,444126,128,48337,534,32102,277,376
12Feb 15, 2023 17:06102,11099,432,29637,780,73802,265,088