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 05:02Andrey TsvetkovAndrey TsvetkovScore: 6,130,923Success
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 05:026,130,6432,325,733,5862,268,337,96702,199,552
2Jul 12, 2021 05:026,130,9232,322,836,8092,268,441,66902,207,744
3Jul 12, 2021 05:026,131,4412,335,571,5822,268,633,14302,199,552