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 listNov 22, 2023 12:03AdrKAdrKScore: 1,141,551Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 22, 2023 12:03867,840391,696,729321,100,92102,301,952
2Nov 22, 2023 12:031,141,551487,626,356422,373,87802,285,568
3Nov 22, 2023 12:031,920,059772,908,229710,421,68702,297,856