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 listFeb 22, 2024 03:27Huy Duc LeHuy Duc LeScore: 73,330Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2024 03:2772,86548,348,34323,965,0002,995,0002,494,464
2Feb 22, 2024 03:2772,88158,832,41424,969,0001,997,0002,494,464
3Feb 22, 2024 03:2772,99249,231,76724,007,0003,000,0002,494,464
4Feb 22, 2024 03:2773,10850,171,01425,047,0002,003,0002,498,560
5Feb 22, 2024 03:2773,24150,260,57826,096,0001,003,0002,281,472
6Feb 22, 2024 03:2773,27052,905,18322,090,0005,020,0002,490,368
7Feb 22, 2024 03:2773,33061,041,91025,123,0002,009,0002,490,368
8Feb 22, 2024 03:2773,41953,564,12327,165,00002,478,080
9Feb 22, 2024 03:2773,48656,836,46124,169,0003,021,0002,486,272
10Feb 22, 2024 03:2777,47291,955,93528,664,74002,240,512
11Feb 22, 2024 03:2777,793104,081,31328,783,40802,228,224
12Feb 22, 2024 03:2777,83197,374,46628,797,59502,220,032