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 listAug 29, 2023 11:24mmalczakmmalczakScore: 5,406,432Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2023 11:245,384,9402,066,767,8371,992,427,62802,293,760
2Aug 29, 2023 11:245,406,4322,068,642,9972,000,379,97002,297,856
3Aug 29, 2023 11:245,413,8082,082,987,1722,003,109,11302,289,664