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 listAug 29, 2023 11:44mmalczakmmalczakScore: 664,682Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2023 11:44664,170317,505,467245,742,83502,301,952
2Aug 29, 2023 11:44664,682305,337,815245,932,35802,301,952
3Aug 29, 2023 11:44665,418304,949,408246,204,80902,301,952