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 15:40Huy Duc LeHuy Duc LeScore: 734,424Success
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 15:40726,636319,681,972268,855,14602,260,992
2Feb 21, 2024 15:40734,424335,010,264271,736,90202,285,568
3Feb 21, 2024 15:40814,770367,848,396301,464,83502,301,952