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 listFeb 1, 2025 07:26mebowlermebowlerScore: 711,784Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2025 07:26709,595290,465,262137,764,000124,786,0002,367,488
2Feb 1, 2025 07:26711,784290,703,980143,196,000120,164,0002,424,832
3Feb 1, 2025 07:26717,651295,335,365131,767,000133,764,0002,367,488