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 09:41Andrey TsvetkovAndrey TsvetkovScore: 193,714Success
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 09:41193,521134,694,84971,602,82202,203,648
2Jul 13, 2021 09:41193,714132,556,99271,674,29102,199,552
3Jul 13, 2021 09:41194,123137,030,95071,825,57902,220,032