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 07:07Huy Duc LeHuy Duc LeScore: 74,265Success
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 07:0773,82757,603,99424,281,0003,035,0002,273,280
2Feb 22, 2024 07:0773,85952,647,92823,280,0004,048,0002,519,040
3Feb 22, 2024 07:0774,00353,351,55626,367,0001,014,0002,273,280
4Feb 22, 2024 07:0774,03052,547,46324,348,0003,043,0002,514,944
5Feb 22, 2024 07:0774,07850,199,43226,394,0001,015,0002,273,280
6Feb 22, 2024 07:0774,07851,157,99025,379,0002,030,0002,273,280
7Feb 22, 2024 07:0774,26551,333,33126,461,0001,017,0002,519,040
8Feb 22, 2024 07:0774,30349,940,02026,474,0001,018,0002,273,280
9Feb 22, 2024 07:0774,46853,086,61426,533,0001,020,0002,273,280
10Feb 22, 2024 07:0778,11792,315,72928,903,43502,260,992
11Feb 22, 2024 07:0778,394102,563,47429,005,83402,289,664
12Feb 22, 2024 07:0778,51096,842,47929,048,57502,260,992