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:56Huy Duc LeHuy Duc LeScore: 218,525Success
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:56216,942149,594,23380,268,54102,211,840
2Feb 22, 2024 03:56218,525136,211,66980,854,38302,215,936
3Feb 22, 2024 03:56219,638144,110,63081,265,87502,211,840