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 15, 2021 11:51Igor VolkovIgor VolkovScore: 337,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2021 11:51335,352186,688,546124,080,20702,256,896
2Aug 15, 2021 11:51337,576185,681,734124,903,10502,248,704
3Aug 15, 2021 11:51338,205183,620,785125,135,86202,252,800