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:26Huy Duc LeHuy Duc LeScore: 73,024Success
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:2672,64149,732,70224,887,0001,990,0002,281,472
2Feb 22, 2024 03:2672,71947,565,65222,920,0003,986,0002,490,368
3Feb 22, 2024 03:2672,74358,997,76924,922,0001,993,0002,281,472
4Feb 22, 2024 03:2672,82253,581,78524,949,0001,995,0002,502,656
5Feb 22, 2024 03:2672,89254,144,22124,973,0001,997,0002,285,568
6Feb 22, 2024 03:2672,93551,168,53423,988,0002,998,0002,490,368
7Feb 22, 2024 03:2673,02455,214,98025,018,0002,001,0002,490,368
8Feb 22, 2024 03:2673,06550,533,07825,032,0002,002,0002,330,624
9Feb 22, 2024 03:2673,35450,213,62026,136,0001,005,0002,502,656
10Feb 22, 2024 03:2677,14084,607,48528,541,62202,228,224
11Feb 22, 2024 03:2677,23292,710,67628,575,89802,228,224
12Feb 22, 2024 03:2677,35789,000,52628,622,25302,301,952