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 26, 2023 12:12mmalczakmmalczakScore: 74,192Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2023 12:1474,01289,368,95427,384,42502,269,184
2Sep 26, 2023 12:1274,17895,634,00627,445,97402,265,088
3Sep 26, 2023 12:1274,178110,644,02327,445,70602,265,088
4Sep 26, 2023 12:1474,19288,756,04127,450,89802,269,184
5Sep 26, 2023 12:1274,222109,530,43727,461,97102,269,184
6Sep 26, 2023 12:1474,36598,594,73527,515,22202,273,280