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 listFeb 15, 2023 00:30LiamLiamScore: 21,404,167Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2023 00:3021,386,2567,980,224,4707,912,914,78302,293,760
2Feb 15, 2023 00:3021,404,1677,981,491,7917,919,541,76302,285,568
3Feb 15, 2023 00:3021,406,6467,988,028,6847,920,458,98202,289,664