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: 78,992Success
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:0378,500103,148,51029,045,01302,240,512
2Aug 4, 2023 17:0378,992105,059,29829,227,21302,244,608
3Aug 4, 2023 17:0379,059103,365,16929,251,91502,248,704