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:19mmalczakmmalczakScore: 74,357Success
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:1974,25495,657,05727,473,96802,273,280
2Sep 25, 2023 22:1974,357100,172,78127,512,01102,273,280
3Sep 25, 2023 22:1974,87986,697,57727,705,06002,269,184