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:07Andrey TsvetkovAndrey TsvetkovScore: 317,492Success
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:07317,482169,795,896117,468,23602,191,360
2Jul 12, 2021 18:07317,492175,099,641117,472,15702,199,552
3Jul 12, 2021 18:07317,720184,482,934117,556,38002,183,168