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 12:27gchebanovgchebanovScore: 80,133Success
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 12:2779,88392,201,59729,556,53702,248,704
2Jul 14, 2021 12:2780,133103,610,51029,649,38402,240,512
3Jul 14, 2021 12:2782,80899,581,82530,638,95502,252,800