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 06:59Huy Duc LeHuy Duc LeScore: 72,695Success
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 06:5972,47053,934,05624,828,0001,986,0002,273,280
2Feb 22, 2024 06:5972,50854,507,08625,835,000993,0002,273,280
3Feb 22, 2024 06:5972,57059,136,60423,868,0002,983,0002,510,848
4Feb 22, 2024 06:5972,60051,330,97124,873,0001,989,0002,338,816
5Feb 22, 2024 06:5972,63852,668,77624,886,0001,990,0002,519,040
6Feb 22, 2024 06:5972,67356,050,26126,889,00002,273,280
7Feb 22, 2024 06:5972,69559,916,56725,863,0001,034,0002,514,944
8Feb 22, 2024 06:5972,87057,088,58323,967,0002,995,0002,273,280
9Feb 22, 2024 06:5973,10359,167,46225,045,0002,003,0002,514,944
10Feb 22, 2024 06:5976,94088,204,63728,467,82302,252,800
11Feb 22, 2024 06:5977,152104,521,45828,546,20202,252,800
12Feb 22, 2024 06:5977,88295,769,32428,816,37502,252,800