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:28Franek 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:2800000Error: expected "429496456836 ", got "429496456664 "stderr
2Aug 29, 2023 21:2965,75078,510,61824,327,52702,179,072
3Aug 29, 2023 21:2965,82464,754,59924,354,97702,174,976
4Aug 29, 2023 21:2966,044101,008,97724,436,16402,301,952