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:50mmalczakmmalczakScore: 73,999Success
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:5073,88092,871,31327,335,65702,256,896
2Sep 25, 2023 21:5073,99992,793,83827,379,70002,265,088
3Sep 25, 2023 21:5075,039107,448,38627,764,49002,265,088