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 03:23Huy Duc LeHuy Duc LeScore: 74,638Success
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 03:2373,94651,206,52424,320,0003,040,0002,281,472
2Feb 22, 2024 03:2374,38153,893,14425,483,0002,038,0002,494,464
3Feb 22, 2024 03:2374,45750,042,29327,549,00002,490,368
4Feb 22, 2024 03:2374,50054,085,98326,545,0001,020,0002,281,472
5Feb 22, 2024 03:2374,57657,434,13027,593,00002,281,472
6Feb 22, 2024 03:2374,58953,972,71826,576,0001,022,0002,281,472
7Feb 22, 2024 03:2374,63857,297,27626,594,0001,022,0002,285,568
8Feb 22, 2024 03:2374,65158,224,71426,598,0001,023,0002,281,472
9Feb 22, 2024 03:2374,85955,502,14826,673,0001,025,0002,494,464
10Feb 22, 2024 03:2378,72890,691,65729,129,46702,220,032
11Feb 22, 2024 03:2379,009104,017,86829,233,19502,293,760
12Feb 22, 2024 03:2379,22789,140,01329,314,01902,220,032