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 21:43Kenneth MaplesKenneth MaplesScore: 146,048Success
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 21:43145,825421,371,171364,562,42802,215,936
2Dec 24, 2023 21:43146,048435,130,270365,118,82502,228,224
3Dec 24, 2023 21:43146,072425,491,731365,179,51502,224,128