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,440,223Success
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,390,1057,991,988,0847,914,338,88302,285,568
2Feb 15, 2023 00:3021,440,2238,006,973,0637,932,882,33102,285,568
3Feb 15, 2023 00:3021,516,4738,018,802,7597,961,094,89402,293,760