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 28, 2023 21:32Franek KortaFranek KortaScore: 69,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2023 21:3269,63789,189,03425,765,55702,293,760
2Aug 28, 2023 21:3269,721112,099,61425,796,84602,199,552
3Aug 28, 2023 21:3270,21293,206,70225,978,34202,285,568