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 24, 2023 21:22mmalczakmmalczakScore: 76,592Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2023 21:2274,07855,242,69726,394,0001,015,0002,269,184
2Sep 24, 2023 21:2274,45453,274,17226,528,0001,020,0002,289,664
3Sep 24, 2023 21:2274,64662,545,66726,597,0001,022,0002,289,664
4Sep 24, 2023 21:2275,27653,035,29226,858,000994,0002,269,184
5Sep 24, 2023 21:2275,82252,855,78627,053,0001,001,0002,289,664
6Sep 24, 2023 21:2276,45954,598,34527,280,0001,010,0002,281,472
7Sep 24, 2023 21:2276,59249,205,67526,315,0002,024,0002,375,680
8Sep 24, 2023 21:2278,32752,737,02527,982,000999,0002,277,376
9Sep 24, 2023 21:2278,76392,057,88929,142,14802,256,896
10Sep 24, 2023 21:2279,07193,779,54229,256,20602,256,896
11Sep 24, 2023 21:2279,259111,239,20429,325,67802,260,992
12Sep 24, 2023 21:2279,65958,324,03928,492,000982,0002,289,664