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 listAug 10, 2023 06:36parsersmailparsersmailScore: 1,652,466Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2023 06:361,651,9054,193,399,8174,129,763,62802,179,072
2Aug 10, 2023 06:361,652,4664,186,026,7004,131,165,52702,187,264
3Aug 10, 2023 06:361,652,6754,224,028,7304,131,688,25002,179,072