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,353Success
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,041125,836,27527,395,23202,277,376
2Sep 25, 2023 21:4374,353103,804,25027,510,55402,260,992
3Sep 25, 2023 21:4375,00495,587,19127,751,61702,269,184