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:38Huy Duc LeHuy Duc LeScore: 281,340Success
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:38267,247175,922,97698,881,34502,174,976
2Feb 21, 2024 15:38281,340169,282,678104,095,66502,260,992
3Feb 21, 2024 15:38283,943164,192,840105,058,77702,273,280