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 listJul 9, 2023 18:29Bernard TeoBernard TeoScore: 1,652,013Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2023 18:291,651,5034,202,688,5474,128,757,21002,306,048
2Jul 9, 2023 18:291,652,0134,193,519,4654,130,031,79002,252,800
3Jul 9, 2023 18:291,652,2124,188,060,9754,130,529,08002,183,168