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 2, 2023 22:54Franek KortaFranek KortaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2023 22:5400000Error: expected "429496492529 ", got "429496487920"stderr
2Sep 2, 2023 22:5464,97185,773,99124,039,27402,285,568
3Sep 2, 2023 22:5465,01286,534,43624,054,35202,289,664
4Sep 2, 2023 22:5466,15187,966,34924,476,04202,293,760