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 20:03Kenneth MaplesKenneth MaplesScore: 246,730Success
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 20:03246,667681,411,070616,666,77702,179,072
2Dec 24, 2023 20:03246,730674,960,112616,826,22302,306,048
3Dec 24, 2023 20:03246,822674,273,370617,053,78802,301,952