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 listJul 15, 2021 10:59Andrey TsvetkovAndrey TsvetkovScore: 89,087Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2021 11:0088,535109,104,13532,757,92802,183,168
2Jul 15, 2021 11:0088,805102,807,87832,857,97802,306,048
3Jul 15, 2021 10:5989,05297,235,61232,949,32902,183,168
4Jul 15, 2021 10:5989,059109,445,03932,951,85902,179,072
5Jul 15, 2021 11:0089,08798,013,89932,962,35402,187,264
6Jul 15, 2021 11:0089,244101,107,13033,020,28602,187,264
7Jul 15, 2021 10:5989,46994,307,66633,103,68402,301,952
8Jul 15, 2021 11:0089,721101,458,46733,196,74102,179,072
9Jul 15, 2021 11:0089,800105,102,21733,225,83702,289,664