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 19:05Yuriy LyfenkoYuriy LyfenkoError
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 19:0500000Error: expected "429496486389 ", got "129 [4294957376 4294957427 4294957429 4294957448 4294957560 4294957643 4294957645 4294957667 4294957737 4294957811 4294957833 4294958017 4294958020 4294958031 4294958128 4294958141 4294958226 4294958266 4294958285 ...