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 24, 2023 21:23mmalczakmmalczakScore: 72,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2023 21:2372,55156,293,45924,856,0001,988,0002,527,232
2Sep 24, 2023 21:2372,59751,674,08224,872,0001,989,0002,281,472
3Sep 24, 2023 21:2372,70549,460,90125,905,000996,0002,281,472
4Sep 24, 2023 21:2372,83556,888,33125,951,000998,0002,277,376
5Sep 24, 2023 21:2372,84349,630,48724,956,0001,996,0002,265,088
6Sep 24, 2023 21:2372,89555,600,61825,973,000998,0002,289,664
7Sep 24, 2023 21:2372,96552,478,41124,998,0001,999,0002,277,376
8Sep 24, 2023 21:2373,04654,157,55025,025,0002,002,0002,289,664
9Sep 24, 2023 21:2373,22457,562,39326,090,0001,003,0002,277,376
10Sep 24, 2023 21:2375,821102,199,35028,053,80102,265,088
11Sep 24, 2023 21:2375,97884,628,00628,111,84302,273,280
12Sep 24, 2023 21:2376,019103,703,36028,127,12702,265,088