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 listAug 4, 2023 16:59gchebanovgchebanovScore: 77,391Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2023 16:5976,10392,919,51928,158,19402,248,704
2Aug 4, 2023 16:5977,391102,547,93128,634,58302,256,896
3Aug 4, 2023 16:5977,81491,242,43328,791,35902,244,608