Large integer multiplication Bernard Teo

Multiply two large unsigned integers as fast as possible.

Input

Exactly 500,000 bytes on STDIN: two unsigned integers encoded back-to-back, each 250,000 bytes, in little-endian byte order.

Output

Write exactly 500,000 bytes to STDOUT containing the product in little-endian byte order.

Back to listJul 17, 2023 14:43matsuoka-601matsuoka-601Score: 4,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2023 14:433,80257,234,3309,504,65202,260,992
2Jul 17, 2023 14:433,82064,452,7559,550,12402,256,896
3Jul 17, 2023 14:433,92170,699,1319,803,13502,240,512
4Jul 17, 2023 14:433,96430,014,1206,937,0002,973,0002,338,816
5Jul 17, 2023 14:433,97729,776,3764,971,0004,971,0002,297,856
6Jul 17, 2023 14:433,97929,232,0264,974,0004,974,0002,465,792
7Jul 17, 2023 14:434,04925,399,0724,049,0006,074,0002,347,008
8Jul 17, 2023 14:434,05131,479,6966,076,0004,051,0002,510,848
9Jul 17, 2023 14:434,06127,034,1356,092,0004,061,0002,510,848
10Jul 17, 2023 14:434,18830,613,4266,282,0004,188,0002,531,328
11Jul 17, 2023 14:434,36232,670,1364,957,0005,949,0002,510,848
12Jul 17, 2023 14:434,36528,268,7076,945,0003,968,0002,519,040