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 6, 2022 18:12Franek KortaFranek KortaScore: 210,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2022 18:12210,108142,156,85077,739,84202,236,416
2Aug 6, 2022 18:12210,278131,679,43777,802,76802,236,416
3Aug 6, 2022 18:12210,541142,438,96777,900,03702,265,088