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 2, 2022 08:30Robert BurkeRobert BurkeScore: 65,824Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 08:3065,48675,334,86224,229,97502,256,896
2Aug 2, 2022 08:3065,82480,529,27524,354,85502,281,472
3Aug 2, 2022 08:3065,90380,038,68824,384,25002,281,472