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:03gchebanovgchebanovScore: 80,359Success
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:0380,04888,796,51829,617,77802,199,552
2Aug 4, 2023 17:0380,35998,425,08929,732,89302,199,552
3Aug 4, 2023 17:0381,092105,401,21030,004,20702,322,432