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:42mmalczakmmalczakScore: 689,400Success
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:43687,770320,708,499254,474,80602,174,976
2Aug 29, 2023 11:43688,337319,092,951254,684,66502,281,472
3Aug 29, 2023 11:43688,729320,100,626254,829,64102,297,856
4Aug 29, 2023 11:42689,400313,474,659255,078,11402,174,976
5Aug 29, 2023 11:42689,793315,631,016255,223,48302,297,856
6Aug 29, 2023 11:42690,436320,372,973255,461,14802,306,048