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 16, 2023 16:12mmalczakmmalczakScore: 99,604Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2023 16:1298,27660,123,39636,362,00002,285,568
2Sep 16, 2023 16:1298,49257,220,92135,430,0001,012,0002,289,664
3Sep 16, 2023 16:1298,80359,501,28735,542,0001,015,0002,277,376
4Sep 16, 2023 16:1299,19564,103,14434,719,0001,983,0002,277,376
5Sep 16, 2023 16:1299,23867,764,23035,726,000992,0002,289,664
6Sep 16, 2023 16:1299,60365,306,76034,861,0001,992,0002,363,392
7Sep 16, 2023 16:1299,604101,794,59836,853,42802,260,992
8Sep 16, 2023 16:1299,60861,939,60634,863,0001,992,0002,527,232
9Sep 16, 2023 16:1299,75959,890,01434,916,0001,995,0002,289,664
10Sep 16, 2023 16:12100,20059,741,92435,070,0002,004,0002,289,664
11Sep 16, 2023 16:12100,236105,383,45937,087,41302,256,896
12Sep 16, 2023 16:12100,318107,556,56937,117,71402,265,088