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 15, 2021 13:35Andrey TsvetkovAndrey TsvetkovError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2021 13:3600000Error: expected "429496436783 ", got "373661931092 "
2Jul 15, 2021 13:3588,65498,616,58332,802,14502,191,360
3Jul 15, 2021 13:3589,20399,937,16033,005,19202,301,952
4Jul 15, 2021 13:3589,45594,520,36833,098,48602,187,264