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 09:55mmalczakmmalczakScore: 21,301,915Success
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 09:5521,275,3357,959,967,7527,871,873,97502,281,472
2Aug 29, 2023 09:5521,301,9157,940,148,5597,881,708,71602,289,664
3Aug 29, 2023 09:5521,326,1577,962,616,9257,890,678,17502,285,568