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 14, 2023 14:16Yurkov AlekseyYurkov AlekseyScore: 180,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2023 14:16179,970127,667,89066,589,06002,265,088
2May 14, 2023 14:16180,159134,057,40366,658,87702,244,608
3May 14, 2023 14:16180,361132,828,90566,733,59502,252,800