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 13, 2021 16:51Yuriy LyfenkoYuriy LyfenkoScore: 170,099Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 16:51169,944120,400,41162,879,14802,179,072
2Jul 13, 2021 16:51170,099122,417,90562,936,60802,183,168
3Jul 13, 2021 16:51170,274148,098,49363,001,34102,306,048