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 listFeb 22, 2024 07:12Huy Duc LeHuy Duc LeScore: 74,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2024 07:1273,71452,559,40324,244,0003,030,0002,514,944
2Feb 22, 2024 07:1273,80354,530,26225,285,0002,022,0002,273,280
3Feb 22, 2024 07:1273,90849,626,82324,308,0003,038,0002,527,232
4Feb 22, 2024 07:1274,02250,774,67925,360,0002,028,0002,510,848
5Feb 22, 2024 07:1274,06850,730,63724,360,0003,045,0002,510,848
6Feb 22, 2024 07:1274,06850,577,07225,375,0002,030,0002,273,280
7Feb 22, 2024 07:1274,37850,936,40325,482,0002,038,0002,273,280
8Feb 22, 2024 07:1274,41453,153,45325,494,0002,039,0002,510,848
9Feb 22, 2024 07:1274,62457,744,82325,639,0001,972,0002,514,944
10Feb 22, 2024 07:1278,24191,490,02628,949,14502,248,704
11Feb 22, 2024 07:1278,56092,611,85029,067,17302,265,088
12Feb 22, 2024 07:1278,67487,979,40529,109,38502,248,704