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 19, 2023 08:00mmalczakmmalczakScore: 94,165Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2023 08:0093,37356,745,82533,532,0001,016,0002,277,376
2Sep 19, 2023 08:0093,38458,821,06634,552,00002,289,664
3Sep 19, 2023 08:0093,43256,635,24333,554,0001,016,0002,277,376
4Sep 19, 2023 08:0093,48161,020,24033,571,0001,017,0002,289,664
5Sep 19, 2023 08:0093,62759,058,92833,624,0001,018,0002,375,680
6Sep 19, 2023 08:0093,84659,735,70534,723,00002,269,184
7Sep 19, 2023 08:0094,16565,834,71332,851,0001,990,0002,527,232
8Sep 19, 2023 08:0094,16862,899,12533,847,000995,0002,289,664
9Sep 19, 2023 08:0094,33062,721,49832,908,0001,994,0002,289,664
10Sep 19, 2023 08:0096,801112,681,30235,816,48102,269,184
11Sep 19, 2023 08:0097,21598,097,84635,969,66102,273,280
12Sep 19, 2023 08:0097,565116,690,57936,099,22202,269,184