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 listMay 23, 2024 17:52CemaCemaScore: 94,251Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2024 17:5292,42256,362,29031,179,0003,017,0002,510,848
2May 23, 2024 17:5293,17065,405,78633,460,0001,013,0002,502,656
3May 23, 2024 17:5293,53063,208,80533,589,0001,017,0002,281,472
4May 23, 2024 17:5293,61158,321,88332,599,0002,037,0002,293,760
5May 23, 2024 17:5293,74958,872,56633,667,0001,020,0002,347,008
6May 23, 2024 17:5293,80562,945,03232,667,0002,041,0002,363,392
7May 23, 2024 17:5294,25157,036,41132,881,0001,992,0002,281,472
8May 23, 2024 17:5294,37058,900,72932,922,0001,995,0002,281,472
9May 23, 2024 17:5294,94159,493,10333,121,0002,007,0002,281,472
10May 23, 2024 17:5297,04691,110,89135,907,16902,240,512
11May 23, 2024 17:5297,622111,740,58736,120,29402,228,224
12May 23, 2024 17:5298,26795,005,19936,358,75102,240,512