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 listJul 13, 2021 17:24Yuriy LyfenkoYuriy LyfenkoScore: 96,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 17:2495,36557,811,65832,261,0003,024,0002,527,232
2Jul 13, 2021 17:2495,56856,431,99133,340,0002,020,0002,523,136
3Jul 13, 2021 17:2495,83260,558,29834,445,0001,013,0002,334,720
4Jul 13, 2021 17:2495,90058,483,32134,470,0001,013,0002,523,136
5Jul 13, 2021 17:2496,06857,432,83833,514,0002,031,0002,527,232
6Jul 13, 2021 17:2496,16261,438,69033,604,0001,976,0002,523,136
7Jul 13, 2021 17:2496,86563,581,99933,849,0001,991,0002,334,720
8Jul 13, 2021 17:2496,87863,051,65032,858,0002,987,0002,523,136
9Jul 13, 2021 17:2496,93565,003,87033,874,0001,992,0002,392,064
10Jul 13, 2021 17:2498,10396,725,86536,298,08702,183,168
11Jul 13, 2021 17:2498,472101,385,91036,434,45602,187,264
12Jul 13, 2021 17:2499,04792,555,71236,647,23002,179,072