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 19:05LiamLiamError
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 19:0500000Error: expected "429496523379 ", got "429496521055 "stderr
2Feb 15, 2023 19:0600000Error: expected "429496551930 ", got "429496534403 "stderr
3Feb 15, 2023 19:0698,79794,376,81236,554,80302,269,184
4Feb 15, 2023 19:0699,619100,833,78236,858,98402,269,184
5Feb 15, 2023 19:06100,218101,264,94537,080,67202,215,936