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 21, 2023 18:27mmalczakmmalczakScore: 86,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2023 18:2785,581105,712,64231,665,11002,277,376
2Sep 21, 2023 18:2786,37085,232,67731,956,88202,265,088
3Sep 21, 2023 18:2787,129106,092,66932,237,69702,252,800