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 listJul 16, 2023 15:03Paul MasurelPaul MasurelScore: 70,849Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2023 15:0369,87056,050,56723,864,0001,988,0002,355,200
2Jul 16, 2023 15:0369,93251,132,25923,885,0001,990,0002,285,568
3Jul 16, 2023 15:0370,26250,364,14824,998,000999,0002,281,472
4Jul 16, 2023 15:0370,33251,730,92224,022,0002,001,0002,285,568
5Jul 16, 2023 15:0370,34152,607,73725,025,0001,001,0002,285,568
6Jul 16, 2023 15:0370,40353,235,20524,046,0002,003,0002,281,472
7Jul 16, 2023 15:0370,84948,451,59725,206,0001,008,0002,277,376
8Jul 16, 2023 15:0372,75455,674,08225,922,000997,0002,347,008
9Jul 16, 2023 15:0373,58993,968,82527,227,82302,199,552
10Jul 16, 2023 15:0374,67891,526,43927,630,91502,191,360
11Jul 16, 2023 15:0376,66550,001,32726,340,0002,026,0002,285,568
12Jul 16, 2023 15:0383,521102,292,06330,902,81202,318,336