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 10:45mmalczakmmalczakScore: 21,091,464Success
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 10:4521,032,1237,846,590,6767,781,885,65202,293,760
2Aug 29, 2023 10:4521,091,4647,861,042,4147,803,841,70902,174,976
3Aug 29, 2023 10:4521,175,1997,911,437,5057,834,823,70602,293,760