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:50Yuriy LyfenkoYuriy LyfenkoScore: 574,187Success
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:50574,0341,503,682,4541,435,084,60502,273,280
2Jul 10, 2023 17:50574,1871,492,951,3581,435,466,66602,273,280
3Jul 10, 2023 17:50574,3341,504,784,7501,435,835,58402,273,280