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:25mmalczakmmalczakScore: 74,202Success
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:2573,88993,982,21527,338,88702,265,088
2Sep 27, 2023 15:2574,20287,026,96327,454,60902,256,896
3Sep 27, 2023 15:2574,33389,028,25827,503,26502,260,992