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:59Huy Duc LeHuy Duc LeScore: 72,749Success
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:5972,60051,345,73123,878,0002,984,0002,490,368
2Feb 22, 2024 03:5972,61652,331,71423,883,0002,985,0002,494,464
3Feb 22, 2024 03:5972,61956,259,45025,874,000995,0002,494,464
4Feb 22, 2024 03:5972,63556,753,93824,885,0001,990,0002,281,472
5Feb 22, 2024 03:5972,66553,575,98923,784,0003,102,0002,490,368
6Feb 22, 2024 03:5972,74352,281,23824,922,0001,993,0002,498,560
7Feb 22, 2024 03:5972,74959,198,68724,924,0001,993,0002,281,472
8Feb 22, 2024 03:5972,87055,065,66324,965,0001,997,0002,281,472
9Feb 22, 2024 03:5973,06255,745,11425,031,0002,002,0002,281,472
10Feb 22, 2024 03:5977,012106,101,54028,494,60902,232,320
11Feb 22, 2024 03:5977,28792,216,21028,596,10702,232,320
12Feb 22, 2024 03:5977,355100,060,04628,621,51702,232,320