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 7, 2021 20:23Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2021 20:2300000Error: expected "20528577614 ", got "205285856 "
2Jul 7, 2021 20:2400000Error: expected "429496505637 ", got "4294967281 "
3Jul 7, 2021 20:2600000Error: expected "429496505213 ", got "4294967253 "