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:11Franek 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:1100000Error: expected "429496477610 ", got "429496474851 "stderr
2Aug 29, 2023 21:1200000Error: expected "429496509619 ", got "429496507747 "stderr
3Aug 29, 2023 21:1366,80497,752,45524,717,56402,297,856
4Aug 29, 2023 21:1366,841105,744,73424,731,13202,297,856
5Aug 29, 2023 21:1367,438100,996,19024,952,13702,297,856