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 8, 2021 12:12Yuriy LyfenkoYuriy LyfenkoScore: 93,146Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 12:1290,58697,665,33433,516,94602,191,360
2Jul 8, 2021 12:1293,146100,680,04434,463,94502,297,856
3Jul 8, 2021 12:1293,59191,918,67634,628,65502,297,856