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:00LiamLiamError
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:0000000Error: expected "429496518252 ", got "376243061495 "
2Feb 15, 2023 19:0000000Error: expected "429496505296 ", got "400859781808 "
3Feb 15, 2023 19:0100000Error: expected "429496512956 ", got "415049966357 "
4Feb 15, 2023 19:0100000Error: expected "429496505921 ", got "388357156100 "
5Feb 15, 2023 19:0100000Error: expected "429496454754 ", got "332415044989 "
6Feb 15, 2023 19:0100000Error: expected "429496497579 ", got "394735012413 "
7Feb 15, 2023 19:0100000Error: expected "429496488601 ", got "381883428310 "