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 28, 2023 16:28mmalczakmmalczakScore: 74,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2023 16:2873,93197,988,48927,354,39602,252,800
2Sep 28, 2023 16:2874,35069,766,43227,509,55302,256,896
3Sep 28, 2023 16:2874,74088,656,28227,653,70002,273,280