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 8, 2024 06:49E SequeiraE SequeiraScore: 401,727Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2024 06:49401,6131,028,862,9401,003,032,0001,000,0002,281,472
2Dec 8, 2024 06:49401,7271,030,356,5051,001,320,0002,997,0002,293,760
3Dec 8, 2024 06:49402,0781,038,456,3841,000,200,0004,996,0002,293,760