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 7, 2021 20:13Yuriy LyfenkoYuriy LyfenkoScore: 5,424,271Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2021 20:135,418,5452,442,851,9132,004,861,646063,102,976
2Jul 7, 2021 20:135,424,2712,504,447,3802,006,980,138063,488,000
3Jul 7, 2021 20:135,426,9212,555,159,4042,007,960,799056,942,592