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:05mmalczakmmalczakScore: 74,338Success
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:0574,12875,158,13027,427,24402,273,280
2Sep 27, 2023 15:0574,33886,924,63927,505,17902,260,992
3Sep 27, 2023 15:0574,81484,012,05927,680,99702,269,184