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 7, 2021 23:57Yuriy LyfenkoYuriy LyfenkoScore: 152,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2021 23:57152,4491,031,721,14256,406,156065,568,768
2Jul 7, 2021 23:57152,9131,059,571,67056,577,761060,600,320
3Jul 7, 2021 23:57169,5951,056,876,30862,749,980065,175,552