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 19:08Kenneth MaplesKenneth MaplesScore: 981,873Success
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 19:08981,8392,519,829,2172,454,598,52802,199,552
2Dec 24, 2023 19:08981,8732,518,112,6292,454,682,08902,203,648
3Dec 24, 2023 19:08982,2612,516,208,9242,455,653,00502,199,552