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 14, 2024 13:27Joad NacerJoad NacerScore: 74,861Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2024 13:2769,435106,029,94025,690,92102,269,184
2May 14, 2024 13:2774,86191,592,16227,698,62902,281,472
3May 14, 2024 13:2775,07092,976,98927,775,93102,273,280