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:21Andrey TsvetkovAndrey TsvetkovScore: 218,449Success
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:21218,391157,405,54980,804,59902,203,648
2Jul 13, 2021 10:21218,449144,122,86680,826,00402,211,840
3Jul 13, 2021 10:21220,011156,834,82981,404,13502,220,032