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:28mmalczakmmalczakScore: 21,334,227Success
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:0621,258,1177,939,290,8097,865,503,16102,293,760
2Aug 29, 2023 10:0621,267,5327,948,904,6207,868,986,92402,285,568
3Aug 29, 2023 10:2821,268,2677,931,261,3387,869,258,82302,289,664
4Aug 29, 2023 10:0621,334,2277,954,354,4787,893,664,04402,289,664
5Aug 29, 2023 10:2821,335,2367,951,974,6817,894,037,28602,306,048
6Aug 29, 2023 10:2821,443,5057,998,378,0997,934,097,03102,301,952