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 30, 2022 20:38PhibPhibScore: 1,738,871Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2022 20:38914,418397,588,675338,334,67302,306,048
2Sep 30, 2022 20:381,738,871722,861,113643,382,15502,310,144
3Sep 30, 2022 20:381,908,709783,582,258706,222,31102,306,048