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 listSep 10, 2021 13:49Andrey TsvetkovAndrey TsvetkovScore: 91,073Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2021 13:4990,697102,552,71233,557,74102,228,224
2Sep 10, 2021 13:4991,07392,587,89933,697,06902,236,416
3Sep 10, 2021 13:4991,955102,813,08634,023,34002,224,128