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:33mmalczakmmalczakScore: 74,348Success
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:3373,96394,196,96127,366,25202,265,088
2Sep 24, 2023 21:4774,17595,632,36527,444,76502,265,088
3Sep 24, 2023 21:4774,18979,018,32727,449,90502,252,800
4Sep 24, 2023 21:3374,34893,862,02027,508,92102,269,184
5Sep 24, 2023 21:4774,38594,399,04627,522,37502,260,992
6Sep 24, 2023 21:3374,77592,032,21527,666,63602,269,184