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 14, 2021 09:58Andrey TsvetkovAndrey TsvetkovScore: 91,724Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2021 09:5891,10887,905,65733,709,81102,183,168
2Jul 14, 2021 09:5891,72483,213,45833,937,98202,187,264
3Jul 14, 2021 09:5891,962102,928,58334,026,07802,187,264