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 listApr 9, 2023 19:56Franek KortaFranek KortaScore: 85,046Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2023 19:5684,51492,042,37431,270,15002,293,760
2Apr 9, 2023 19:5685,046101,141,98631,467,01702,174,976
3Apr 9, 2023 19:5686,90193,568,21232,153,36002,293,760