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 24, 2021 06:26Andrey TsvetkovAndrey TsvetkovScore: 91,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2021 06:2690,65486,162,91033,542,11802,232,320
2Sep 7, 2021 18:0990,85090,453,86733,614,51702,236,416
3Aug 24, 2021 06:2790,92898,703,48333,643,18402,236,416
4Aug 24, 2021 06:2691,01093,401,21233,673,83302,228,224
5Aug 24, 2021 06:2791,61092,539,50433,895,77902,232,320
6Sep 7, 2021 18:0991,67896,847,28533,920,95102,232,320
7Aug 24, 2021 06:2791,700106,972,01933,929,14702,224,128
8Sep 7, 2021 18:0991,739108,071,68333,943,32602,232,320
9Aug 24, 2021 06:2692,04696,872,96134,057,19802,232,320