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 15, 2021 11:05Andrey TsvetkovAndrey TsvetkovScore: 89,149Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2021 11:0588,84398,568,55332,871,82802,187,264
2Jul 15, 2021 11:0589,149102,761,06832,985,04302,306,048
3Jul 15, 2021 11:0589,546111,143,56533,132,07602,183,168