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 26, 2023 12:13mmalczakmmalczakScore: 74,354Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2023 12:1374,021106,812,96727,387,58602,265,088
2Sep 26, 2023 12:1374,35489,930,67327,510,98402,252,800
3Sep 26, 2023 12:1374,727104,580,99427,649,02502,273,280