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 listApr 3, 2023 21:41Yurkov AlekseyYurkov AlekseyScore: 99,592Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2023 21:4198,51663,158,41534,426,0002,025,0002,289,664
2Apr 3, 2023 21:4198,56564,482,83534,443,0002,026,0002,289,664
3Apr 3, 2023 21:4198,77663,020,75336,547,00002,289,664
4Apr 3, 2023 21:4198,93561,131,46136,606,00002,289,664
5Apr 3, 2023 21:4199,17662,656,57935,676,0001,019,0002,289,664
6Apr 3, 2023 21:4199,57661,682,27934,852,0001,991,0002,269,184
7Apr 3, 2023 21:4199,59263,386,47336,849,00002,351,104
8Apr 3, 2023 21:4199,59561,800,88134,859,0001,991,0002,277,376
9Apr 3, 2023 21:4199,77660,006,03034,922,0001,995,0002,289,664
10Apr 3, 2023 21:41100,618104,386,62737,228,80902,256,896
11Apr 3, 2023 21:41100,956106,485,36237,353,55802,260,992
12Apr 3, 2023 21:41101,161103,366,75637,429,44002,269,184