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:14mmalczakmmalczakScore: 21,135,434Success
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:1421,012,9807,842,387,2407,774,802,76702,306,048
2Aug 29, 2023 11:1421,135,4347,894,060,8867,820,110,61202,301,952
3Aug 29, 2023 11:1421,153,8967,888,330,9677,826,941,58102,297,856