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 13, 2021 10:08Andrey TsvetkovAndrey TsvetkovScore: 289,458Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 10:08288,919170,847,889106,899,92902,195,456
2Jul 13, 2021 10:09289,265179,882,158107,028,14202,195,456
3Jul 13, 2021 10:09289,456188,830,085107,098,62702,191,360
4Jul 13, 2021 10:08289,458171,586,463107,099,54202,199,552
5Jul 13, 2021 10:09289,726174,995,461107,198,67302,203,648
6Jul 13, 2021 10:08289,764162,656,700107,212,54202,183,168