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 listNov 20, 2023 17:34Yuriy LyfenkoYuriy LyfenkoScore: 59,241Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2023 17:3458,885175,492,448137,198,00010,014,0002,400,256
2Nov 20, 2023 17:3459,028176,630,975134,521,00013,050,0002,445,312
3Nov 20, 2023 17:3459,033180,318,056135,536,00012,047,0002,486,272
4Nov 20, 2023 17:3459,047175,810,953137,575,00010,042,0002,355,200
5Nov 20, 2023 17:3459,135175,707,179137,849,0009,989,0002,297,856
6Nov 20, 2023 17:3459,222179,559,206138,051,00010,003,0002,330,624
7Nov 20, 2023 17:3459,241175,435,368143,099,0005,003,0002,400,256
8Nov 20, 2023 17:3459,381174,082,217135,413,00013,039,0002,285,568
9Nov 20, 2023 17:3459,386177,384,151139,438,0009,028,0002,314,240
10Nov 20, 2023 17:3460,395214,147,182150,988,61402,269,184
11Nov 20, 2023 17:3460,577218,862,635151,441,49702,265,088
12Nov 20, 2023 17:3460,625219,536,064151,561,73102,269,184