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 10:11Andrey TsvetkovAndrey TsvetkovScore: 88,686Success
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 10:1188,60191,181,91932,782,43702,215,936
2Jul 14, 2021 10:1188,686104,659,27232,813,73002,310,144
3Jul 14, 2021 10:1189,683112,766,01933,182,80902,297,856