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 21, 2023 18:52mmalczakmmalczakScore: 84,084Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2023 18:5283,07353,834,16729,746,000991,0002,289,664
2Sep 21, 2023 18:5283,36257,912,29830,844,00002,289,664
3Sep 21, 2023 18:5283,43556,889,10929,876,000995,0002,273,280
4Sep 21, 2023 18:5283,54355,514,81029,914,000997,0002,527,232
5Sep 21, 2023 18:5283,63552,568,27928,949,0001,996,0002,531,328
6Sep 21, 2023 18:5283,97653,483,82229,067,0002,004,0002,289,664
7Sep 21, 2023 18:5284,08455,673,55329,104,0002,007,0002,269,184
8Sep 21, 2023 18:5284,18956,836,94229,141,0002,009,0002,289,664
9Sep 21, 2023 18:5284,25953,982,26930,171,0001,005,0002,289,664
10Sep 21, 2023 18:5285,79096,751,23131,742,29802,273,280
11Sep 21, 2023 18:5285,925102,584,87631,792,26702,256,896
12Sep 21, 2023 18:5286,29992,582,91031,930,79802,273,280