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 listAug 30, 2021 12:19Vitaliy F.Vitaliy F.Score: 2,064,196Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2021 12:191,800,039731,473,306666,014,33002,297,856
2Aug 30, 2021 12:192,064,196822,530,330763,752,37602,297,856
3Aug 30, 2021 12:192,515,106990,979,190930,589,32202,306,048