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 listNov 21, 2023 08:52mmalczakmmalczakScore: 1,703,573Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2023 08:521,621,404669,392,868599,919,40602,301,952
2Nov 21, 2023 08:521,703,573684,080,467630,322,02402,289,664
3Nov 21, 2023 08:521,882,257758,158,552696,435,05002,293,760