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 30, 2022 20:39PhibPhibScore: 1,891,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2022 20:391,174,342492,933,795434,506,56202,306,048
2Sep 30, 2022 20:391,891,884765,077,756699,996,91902,220,032
3Sep 30, 2022 20:392,853,4801,125,793,6161,055,787,54702,289,664