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 14, 2023 07:44mmalczakmmalczakScore: 648,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2023 07:37647,053304,937,439239,409,67002,293,760
2Sep 14, 2023 07:37647,404304,496,517239,539,65002,297,856
3Sep 14, 2023 07:44648,055296,916,727239,780,32402,289,664
4Sep 14, 2023 07:44648,811309,769,268240,060,19302,297,856
5Sep 14, 2023 07:44651,532299,633,091241,066,98202,289,664
6Sep 14, 2023 07:37664,233300,733,534245,766,18502,297,856