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 04:09Huy Duc LeHuy Duc LeScore: 72,814Success
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 04:0972,58655,537,20824,868,0001,989,0002,273,280
2Feb 22, 2024 04:0972,60857,057,99622,885,0003,980,0002,273,280
3Feb 22, 2024 04:0972,60853,604,93624,875,0001,990,0002,273,280
4Feb 22, 2024 04:0972,64652,476,96224,888,0001,991,0002,273,280
5Feb 22, 2024 04:0972,65952,768,89025,889,000995,0002,273,280
6Feb 22, 2024 04:0972,66555,710,22924,818,0002,068,0002,519,040
7Feb 22, 2024 04:0972,81456,311,47923,948,0002,993,0002,273,280
8Feb 22, 2024 04:0972,87661,191,44224,967,0001,997,0002,273,280
9Feb 22, 2024 04:0972,87859,297,37223,969,0002,996,0002,514,944
10Feb 22, 2024 04:0976,95284,550,52828,472,27102,252,800
11Feb 22, 2024 04:0977,09790,844,64828,525,85502,244,608
12Feb 22, 2024 04:0977,19484,240,79428,561,75102,256,896