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 07:42mmalczakmmalczakScore: 83,732Success
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 07:4282,74651,380,10529,596,0001,020,0002,285,568
2Sep 19, 2023 07:4283,38655,420,04628,863,0001,990,0002,285,568
3Sep 19, 2023 07:4283,39556,011,38429,861,000995,0002,285,568
4Sep 19, 2023 07:4283,54353,676,69728,917,0001,994,0002,285,568
5Sep 19, 2023 07:4283,58959,646,62928,933,0001,995,0002,273,280
6Sep 19, 2023 07:4283,71953,419,73929,977,000999,0002,535,424
7Sep 19, 2023 07:4283,73255,955,08328,983,0001,998,0002,285,568
8Sep 19, 2023 07:4284,19254,834,42329,142,0002,009,0002,285,568
9Sep 19, 2023 07:4284,68661,184,21729,313,0002,021,0002,285,568
10Sep 19, 2023 07:4285,83385,595,58831,758,12502,260,992
11Sep 19, 2023 07:4286,25493,863,01931,914,10802,256,896
12Sep 19, 2023 07:4286,474115,122,29331,995,29602,265,088