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 listDec 24, 2023 16:43Kenneth MaplesKenneth MaplesScore: 423,619Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2023 16:43423,5921,126,025,5111,058,979,33802,297,856
2Dec 24, 2023 16:43423,6191,121,620,2741,059,048,33702,293,760
3Dec 24, 2023 16:43423,6431,125,053,0611,059,106,67502,293,760