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:31Joad NacerJoad NacerScore: 68,986Success
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:3168,851114,350,24525,474,98002,260,992
2May 7, 2024 00:3168,98690,188,62125,524,78602,281,472
3May 7, 2024 00:3169,21895,353,90125,610,61102,281,472