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 12, 2021 18:21Andrey TsvetkovAndrey TsvetkovScore: 198,593Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2021 18:21198,442130,138,93673,423,52102,195,456
2Jul 12, 2021 18:21198,593141,741,86173,479,48802,199,552
3Jul 12, 2021 18:21198,842133,080,04473,571,68302,203,648