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 listApr 9, 2023 20:52Franek KortaFranek KortaScore: 233,683Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2023 21:02220,445140,124,17881,564,56502,297,856
2Apr 9, 2023 21:02222,174142,293,67182,204,55302,179,072
3Apr 9, 2023 21:02226,966140,684,48583,977,46002,236,416
4Apr 9, 2023 20:52233,683144,627,31386,462,53002,293,760
5Apr 9, 2023 20:52241,107150,092,35389,209,55302,297,856
6Apr 9, 2023 20:52247,389160,750,33291,533,79502,301,952