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 listMay 23, 2024 16:51StanStanScore: 427,918Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2024 16:51427,044222,322,571158,006,34802,252,800
2May 23, 2024 16:51427,918220,485,923158,329,69502,252,800
3May 23, 2024 16:51428,537225,541,334158,558,78402,244,608