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 25, 2023 21:44mmalczakmmalczakScore: 74,752Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2023 21:4473,82591,073,79227,315,25702,269,184
2Sep 25, 2023 21:4474,04693,303,54527,397,09102,265,088
3Sep 25, 2023 21:4774,39395,052,23427,525,27302,269,184
4Sep 25, 2023 21:4774,75295,876,11327,658,35702,260,992
5Sep 25, 2023 21:4775,02692,796,11127,759,46502,269,184
6Sep 25, 2023 21:4475,220113,010,24327,831,38702,260,992