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:42Kenneth MaplesKenneth MaplesScore: 291,939Success
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:42291,847796,317,835729,617,90102,228,224
2Dec 24, 2023 19:42291,939794,426,868729,847,59002,211,840
3Dec 24, 2023 19:42291,947783,031,145729,866,43502,224,128