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, 2023 21:18gchebanovgchebanovScore: 77,017Success
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, 2023 21:1877,00384,806,90128,491,08702,248,704
2Jul 13, 2023 21:1877,017113,802,05228,496,33202,248,704
3Jul 13, 2023 21:1877,25499,489,40428,584,00302,248,704