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 16, 2023 14:35Paul MasurelPaul MasurelScore: 71,808Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2023 14:3570,64651,309,75125,134,0001,005,0002,281,472
2Jul 16, 2023 14:3570,69746,490,95525,152,0001,006,0002,281,472
3Jul 16, 2023 14:3570,77849,372,80824,174,0002,014,0002,359,296
4Jul 16, 2023 14:3570,85947,614,59324,202,0002,016,0002,359,296
5Jul 16, 2023 14:3570,91649,845,89524,221,0002,018,0002,359,296
6Jul 16, 2023 14:3571,76857,052,78025,533,0001,021,0002,351,104
7Jul 16, 2023 14:3571,80847,713,17225,548,0001,021,0002,281,472
8Jul 16, 2023 14:3571,83555,041,73926,579,00002,342,912
9Jul 16, 2023 14:3572,11450,106,67125,656,0001,026,0002,347,008
10Jul 16, 2023 14:3574,87785,065,44927,704,31902,191,360
11Jul 16, 2023 14:3575,94195,086,02328,097,99202,195,456
12Jul 16, 2023 14:3576,18993,330,07828,190,01302,199,552