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 27, 2023 17:18apuxbtapuxbtScore: 6,732,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2023 17:186,698,93411,182,814,7512,478,605,70002,252,800
2Sep 27, 2023 17:186,732,13510,932,973,5112,490,890,12402,224,128
3Sep 27, 2023 17:186,885,49811,856,630,9162,547,634,30602,211,840