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 14, 2021 12:32Mikhail ShirokovMikhail ShirokovScore: 21,750,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2021 12:3221,669,7648,083,642,6758,017,812,55002,289,664
2Sep 14, 2021 12:3221,750,2408,105,846,0878,047,588,75502,285,568
3Sep 14, 2021 12:3221,877,3258,159,173,7088,094,610,27702,285,568