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 24, 2023 21:26mmalczakmmalczakScore: 75,910Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2023 21:2675,31993,318,12927,867,92202,265,088
2Sep 24, 2023 21:2675,522104,353,42627,943,01302,265,088
3Sep 24, 2023 21:3075,60888,492,42827,975,11202,256,896
4Sep 24, 2023 21:3075,91091,190,22428,086,68502,273,280
5Sep 24, 2023 21:2676,21992,463,47228,201,00402,260,992
6Sep 24, 2023 21:3076,22487,198,40628,203,05802,256,896