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 listMay 7, 2024 00:35Joad NacerJoad NacerScore: 68,684Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2024 00:3568,56684,785,19225,369,35702,269,184
2May 7, 2024 00:3568,68496,455,50725,413,22702,273,280
3May 7, 2024 00:3569,12596,062,85925,576,14602,277,376