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 listJul 12, 2021 18:19Andrey TsvetkovAndrey TsvetkovScore: 211,984Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2021 18:19211,796141,336,48078,364,49502,199,552
2Jul 12, 2021 18:19211,984135,675,48378,434,05002,191,360
3Jul 12, 2021 18:19212,052152,261,42478,459,15502,183,168