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 14, 2021 11:37gchebanovgchebanovScore: 111,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2021 11:37110,625117,591,15440,931,27702,244,608
2Jul 14, 2021 11:37111,135115,530,16441,120,08202,252,800
3Jul 14, 2021 11:37111,304110,885,73141,182,49802,244,608