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 22, 2024 03:39Huy Duc LeHuy Duc LeScore: 77,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2024 03:3977,44296,516,16828,653,70502,240,512
2Feb 22, 2024 03:3977,743115,928,62228,764,82602,236,416
3Feb 22, 2024 03:3978,018100,031,48528,866,60202,232,320