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 13, 2021 18:48Yuriy LyfenkoYuriy LyfenkoScore: 67,418Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 18:4867,298581,197,57624,900,42702,244,608
2Jul 13, 2021 18:4867,418593,413,36724,944,75002,240,512
3Jul 13, 2021 18:4867,474585,406,84624,965,45402,240,512