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 5, 2022 21:54Franek KortaFranek KortaScore: 179,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2022 21:54178,597122,555,51966,080,96702,260,992
2Aug 5, 2022 21:54179,051126,401,01166,248,88202,260,992
3Aug 5, 2022 21:54181,083134,557,17867,000,87002,256,896