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 listMar 25, 2023 20:44Yurkov AlekseyYurkov AlekseyScore: 98,627Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2023 20:4497,57363,546,50434,097,0002,005,0002,289,664
2Mar 25, 2023 20:4497,80359,447,54934,177,0002,010,0002,273,280
3Mar 25, 2023 20:4497,93259,848,61634,222,0002,013,0002,527,232
4Mar 25, 2023 20:4497,94657,647,01935,234,0001,006,0002,527,232
5Mar 25, 2023 20:4498,35461,711,02835,381,0001,010,0002,277,376
6Mar 25, 2023 20:4498,46560,057,51834,408,0002,024,0002,273,280
7Mar 25, 2023 20:4498,62762,299,53135,479,0001,013,0002,281,472
8Mar 25, 2023 20:4498,81458,893,67435,546,0001,015,0002,273,280
9Mar 25, 2023 20:4499,06294,275,76636,652,77402,265,088
10Mar 25, 2023 20:4499,11964,950,52135,656,0001,018,0002,289,664
11Mar 25, 2023 20:4499,14198,281,45236,682,25902,277,376
12Mar 25, 2023 20:44100,710111,858,86037,262,86902,269,184