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 25, 2023 22:13mmalczakmmalczakScore: 74,803Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2023 22:1374,77395,149,06127,665,84602,269,184
2Sep 25, 2023 22:1374,80394,640,69327,677,27602,269,184
3Sep 25, 2023 22:1374,80778,223,83927,678,68202,265,088