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 21, 2024 16:13Huy Duc LeHuy Duc LeScore: 93,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2024 16:1392,17362,597,96233,101,0001,003,0002,293,760
2Feb 21, 2024 16:1392,45462,412,87531,190,0003,018,0002,510,848
3Feb 21, 2024 16:1392,92263,156,25532,359,0002,022,0002,293,760
4Feb 21, 2024 16:1393,14358,654,31733,450,0001,013,0002,510,848
5Feb 21, 2024 16:1393,20358,864,66333,471,0001,014,0002,514,944
6Feb 21, 2024 16:1393,67366,331,22432,621,0002,038,0002,506,752
7Feb 21, 2024 16:1393,75461,678,50833,669,0001,020,0002,510,848
8Feb 21, 2024 16:1394,21963,316,49732,869,0001,992,0002,502,656
9Feb 21, 2024 16:1394,23064,860,76531,877,0002,988,0002,297,856
10Feb 21, 2024 16:1395,53895,934,30335,348,96302,236,416
11Feb 21, 2024 16:1397,149113,185,79635,945,18102,236,416
12Feb 21, 2024 16:1397,762119,472,79036,171,83402,236,416