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 10, 2023 17:26Yuriy LyfenkoYuriy LyfenkoScore: 1,851,645Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2023 17:261,851,5124,681,789,0644,628,780,23402,281,472
2Jul 10, 2023 17:261,851,6454,683,327,1134,629,111,99602,269,184
3Jul 10, 2023 17:261,852,4464,705,755,1874,631,116,15002,301,952