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 listAug 29, 2023 21:26Franek KortaFranek KortaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2023 21:2600000Error: expected "429496493655 ", got "429496490019 "stderr
2Aug 29, 2023 21:2600000Error: expected "429496485499 ", got "429496482241 "stderr
3Aug 29, 2023 21:2867,71397,160,80625,053,85202,297,856
4Aug 29, 2023 21:2867,79080,731,63025,082,34802,293,760
5Aug 29, 2023 21:2867,95293,090,38125,142,29502,174,976