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:07gchebanovgchebanovScore: 79,942Success
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:0777,818103,136,74628,792,55002,244,608
2Aug 4, 2023 17:0779,94294,395,33229,578,57202,240,512
3Aug 4, 2023 17:0780,045106,396,08129,616,66402,240,512