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 2, 2023 21:51Franek 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
1Sep 2, 2023 21:5100000Error: expected "429496492896 ", got "429496490203 "stderr
2Sep 2, 2023 21:5165,37493,754,95524,188,54902,297,856
3Sep 2, 2023 21:5165,50689,441,02824,237,11902,301,952
4Sep 2, 2023 21:5166,03787,108,47424,433,81102,293,760