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 20, 2024 18:16CheranMahalingamCheranMahalingamScore: 742,673Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2024 18:16740,130305,045,11278,956,000194,892,0002,285,568
2Sep 20, 2024 18:16742,673301,164,18486,933,000187,856,0002,306,048
3Sep 20, 2024 18:16750,481304,025,89675,912,000201,766,0002,281,472