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:10Yuriy LyfenkoYuriy LyfenkoScore: 197,918Success
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:10194,103643,887,01971,818,07602,187,264
2Jul 8, 2021 12:10197,918635,537,99773,229,70202,195,456
3Jul 8, 2021 12:10219,363630,984,55081,164,26502,281,472