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:23mmalczakmmalczakScore: 74,228Success
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:2373,92298,409,87727,350,95802,273,280
2Sep 27, 2023 15:2374,22898,810,93827,464,31502,256,896
3Sep 27, 2023 15:2374,46285,869,36327,551,00802,260,992