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 16, 2023 10:30mmalczakmmalczakScore: 398,112Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2023 10:30397,578216,727,434147,103,95202,297,856
2Sep 16, 2023 10:30398,112224,183,967147,301,60702,301,952
3Sep 16, 2023 10:30404,082211,848,402149,510,36202,297,856