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 21, 2023 19:01mmalczakmmalczakScore: 231,733Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2023 19:01229,317149,542,05984,847,34602,273,280
2Sep 21, 2023 19:01231,733152,977,14685,741,08902,269,184
3Sep 21, 2023 19:01236,730154,596,00387,589,98302,252,800