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 listMay 6, 2024 19:34Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2024 19:3400000Error: expected "429496473686 ", got "390841814289 "
2May 6, 2024 19:34440,322230,085,451162,919,01202,297,856
3May 6, 2024 19:34441,335228,075,642163,293,94002,297,856
4May 6, 2024 19:34443,142224,892,748163,962,47902,293,760