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 16, 2023 19:22mmalczakmmalczakScore: 84,473Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2023 19:2283,72253,579,50128,979,0001,998,0002,289,664
2Sep 16, 2023 19:2283,76554,892,40328,994,0001,999,0002,289,664
3Sep 16, 2023 19:2283,84658,147,10029,022,0002,001,0002,289,664
4Sep 16, 2023 19:2284,10355,312,14029,111,0002,007,0002,269,184
5Sep 16, 2023 19:2284,17654,631,34530,141,0001,004,0002,289,664
6Sep 16, 2023 19:2284,37852,376,39929,206,0002,014,0002,392,064
7Sep 16, 2023 19:2284,47354,366,94829,239,0002,016,0002,375,680
8Sep 16, 2023 19:2284,47654,342,83929,240,0002,016,0002,273,280
9Sep 16, 2023 19:2284,57052,950,27629,273,0002,018,0002,269,184
10Sep 16, 2023 19:2285,61392,073,79231,676,72802,260,992
11Sep 16, 2023 19:2285,81199,181,08831,750,08302,269,184
12Sep 16, 2023 19:2286,43593,383,64031,981,01702,269,184