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 21, 2024 16:11Huy Duc LeHuy Duc LeScore: 97,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2024 16:1196,045100,187,64035,536,68502,273,280
2Feb 21, 2024 16:1197,030101,865,03335,900,92202,269,184
3Feb 21, 2024 16:1197,785105,778,46936,180,38202,232,320