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,117,565Success
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,886,303768,817,776697,932,19302,203,648
2Aug 30, 2021 12:192,117,565851,207,264783,499,21302,203,648
3Aug 30, 2021 12:192,542,3981,001,529,165940,687,28702,199,552