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:44gchebanovgchebanovScore: 1,259,812Success
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:441,221,219516,099,219451,850,95902,240,512
2Jul 14, 2021 11:441,259,812531,933,330466,130,59602,252,800
3Jul 14, 2021 11:441,263,109537,539,447467,350,47002,240,512