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:29Robert 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:2965,471115,868,72424,224,11802,273,280
2Aug 2, 2022 08:2965,82483,946,95324,354,71102,281,472
3Aug 2, 2022 08:2965,83089,743,56324,357,05502,285,568