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 17:06gchebanovgchebanovScore: 162,709Success
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 17:06161,603121,369,54559,792,97402,240,512
2Aug 4, 2023 17:06162,709121,372,76160,202,48802,240,512
3Aug 4, 2023 17:06163,174126,340,85160,374,55302,244,608