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 listSep 24, 2023 21:32mmalczakmmalczakScore: 75,317Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2023 21:3275,18887,269,78027,819,54302,256,896
2Sep 24, 2023 21:3275,31788,628,23127,867,12902,265,088
3Sep 24, 2023 21:3275,320106,219,91427,868,24002,273,280