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:00gchebanovgchebanovScore: 80,509Success
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:0080,27787,569,49929,702,64202,211,840
2Aug 4, 2023 17:0080,50992,611,31429,788,25602,203,648
3Aug 4, 2023 17:0081,02990,802,36829,980,64002,203,648