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:43mmalczakmmalczakScore: 74,830Success
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:4374,15498,696,99527,436,88902,265,088
2Sep 25, 2023 21:4374,830101,357,62527,687,09402,265,088
3Sep 25, 2023 21:4374,909105,054,14327,716,38502,269,184