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 listAug 9, 2021 06:52David KlassenDavid KlassenScore: 354,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2021 06:52354,556193,904,688131,185,68602,306,048
2Aug 9, 2021 06:52354,581200,695,530131,195,15302,174,976
3Aug 9, 2021 06:52354,586201,429,285131,196,72902,183,168