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 15, 2023 18:22LiamLiamError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2023 18:2200000Error: expected "429496484184 ", got "429496488664 "
2Feb 15, 2023 18:2400000Error: expected "429496495835 ", got "429496496203 "
3Feb 15, 2023 18:2500000Error: expected "429496495308 ", got "429496499506 "
4Feb 15, 2023 18:2500000Error: expected "429496524503 ", got "429496525156 "
5Feb 15, 2023 18:2500000Error: expected "429496505362 ", got "429496505420 "
6Feb 15, 2023 18:2500000Error: expected "429496542406 ", got "429496542462 "
7Feb 15, 2023 18:2500000Error: expected "429496504637 ", got "429496505422 "
8Feb 15, 2023 18:2500000Error: expected "429496489968 ", got "429496494519 "
9Feb 15, 2023 18:2500000Error: expected "429496445148 ", got "429496468696 "
10Feb 15, 2023 18:25111,995106,615,75341,438,28702,273,280
11Feb 15, 2023 18:25112,403117,648,72241,589,11102,273,280
12Feb 15, 2023 18:25112,971107,795,64441,799,27902,256,896