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 listSep 28, 2023 17:07mmalczakmmalczakError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2023 17:0700000Error: expected "429496476931 ", got "429496476881 "stderr
2Sep 28, 2023 17:0700000Error: expected "429496507956 ", got "429496507684 "stderr
3Sep 28, 2023 17:0972,97080,123,98726,998,81802,277,376
4Sep 28, 2023 17:0973,734118,609,75727,281,60002,277,376
5Sep 28, 2023 17:0974,11598,865,88527,422,41802,273,280