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 listMay 12, 2024 00:07richu shaji abrahamrichu shaji abrahamScore: 1,574,497Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2024 00:071,573,8104,000,009,2563,934,524,33402,326,528
2May 12, 2024 00:071,574,4973,999,486,8023,936,243,33302,183,168
3May 12, 2024 00:071,574,9694,007,145,5693,937,421,43502,187,264