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 11, 2021 07:10Sergey StreminSergey StreminScore: 136,985Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2021 07:10136,917113,735,25750,659,39102,215,936
2Sep 11, 2021 07:10136,985110,323,41850,684,46702,269,184
3Sep 11, 2021 07:10137,613119,452,50950,916,95502,207,744