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:01mmalczakmmalczakError
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:0100000Error: expected "429496451581 ", got "429496451430 "stderr
2Sep 28, 2023 17:0173,61788,681,48227,238,22102,281,472
3Sep 28, 2023 17:0173,80491,302,08827,307,63002,277,376
4Sep 28, 2023 17:0173,89194,563,60827,339,50902,281,472