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:40mmalczakmmalczakScore: 21,418,048Success
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:4021,388,3017,978,731,5337,913,671,32802,293,760
2Aug 29, 2023 10:4021,418,0487,987,230,2157,924,677,60702,289,664
3Aug 29, 2023 10:4021,450,2488,001,635,5987,936,591,78502,301,952