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 23, 2024 07:13Huy Duc LeHuy Duc LeScore: 67,662Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2024 07:1367,18457,020,52822,870,0001,988,0002,273,280
2Feb 23, 2024 07:1367,20349,955,94721,882,0002,983,0002,281,472
3Feb 23, 2024 07:1367,33054,731,77621,923,0002,989,0002,510,848
4Feb 23, 2024 07:1367,41650,629,34522,949,0001,995,0002,273,280
5Feb 23, 2024 07:1367,48652,253,55721,974,0002,996,0002,498,560
6Feb 23, 2024 07:1367,64956,061,61222,027,0003,003,0002,498,560
7Feb 23, 2024 07:1367,66257,147,01823,033,0002,002,0002,273,280
8Feb 23, 2024 07:1367,73050,912,29124,058,0001,002,0002,506,752
9Feb 23, 2024 07:1368,03052,660,41521,144,0004,027,0002,347,008
10Feb 23, 2024 07:1372,23684,559,85726,727,20602,240,512
11Feb 23, 2024 07:1372,299101,352,70526,750,74702,260,992
12Feb 23, 2024 07:1372,341110,159,14926,766,23502,236,416