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 27, 2023 15:20mmalczakmmalczakScore: 74,206Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2023 15:2073,82690,987,16327,315,48302,265,088
2Sep 27, 2023 15:2074,20694,026,05227,456,15102,269,184
3Sep 27, 2023 15:2074,33794,046,12427,504,61002,273,280