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 14, 2021 13:54Andrey TsvetkovAndrey TsvetkovScore: 90,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2021 13:5589,11392,645,25332,971,92202,306,048
2Jul 14, 2021 13:5489,639114,363,86033,166,27502,183,168
3Jul 14, 2021 13:5490,254100,728,32333,394,02002,183,168
4Jul 14, 2021 13:5590,416104,813,57633,453,80502,301,952
5Jul 14, 2021 13:5490,85390,610,15533,615,55202,306,048
6Jul 14, 2021 13:5591,03298,053,96933,681,97002,174,976