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 13:26Yuriy LyfenkoYuriy LyfenkoScore: 1,574,857Success
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 13:261,573,5023,974,295,6753,933,754,38902,301,952
2Jul 10, 2023 13:261,574,8574,001,712,8513,937,143,21502,297,856
3Jul 10, 2023 13:261,575,4014,005,987,1143,938,502,46502,285,568