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 16, 2024 23:04CheranMahalingamCheranMahalingamScore: 765,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2024 23:04758,532310,839,27185,895,000194,762,0002,310,144
2Sep 16, 2024 23:04765,743310,120,04370,080,000213,245,0002,306,048
3Sep 16, 2024 23:04777,389316,935,46079,898,000207,736,0002,334,720