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:09Franek 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:0900000Error: expected "429496503248 ", got "429496500432 "stderr
2Aug 29, 2023 21:0966,72687,566,82624,688,70302,285,568
3Aug 29, 2023 21:0967,04282,783,02824,805,43902,289,664
4Aug 29, 2023 21:0967,073104,656,58624,817,15602,289,664