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 18:59mmalczakmmalczakScore: 84,370Success
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 18:5983,35456,787,70129,847,000994,0002,527,232
2Sep 21, 2023 18:5983,74658,214,68728,921,0002,065,0002,289,664
3Sep 21, 2023 18:5983,75455,085,95328,990,0001,999,0002,289,664
4Sep 21, 2023 18:5983,88655,894,32531,038,00002,289,664
5Sep 21, 2023 18:5983,95958,764,70429,061,0002,004,0002,527,232
6Sep 21, 2023 18:5984,30053,118,90330,185,0001,006,0002,289,664
7Sep 21, 2023 18:5984,37057,281,20030,210,0001,007,0002,289,664
8Sep 21, 2023 18:5984,39754,571,15029,213,0002,014,0002,289,664
9Sep 21, 2023 18:5985,01159,538,38030,440,0001,014,0002,289,664
10Sep 21, 2023 18:5985,667111,195,61731,696,75102,269,184
11Sep 21, 2023 18:5985,72281,286,14431,717,07102,260,992
12Sep 21, 2023 18:5986,068103,880,76331,845,29302,265,088