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 29, 2024 21:01Joad NacerJoad NacerScore: 103,242Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2024 21:01103,119282,907,052254,800,0002,997,0002,392,064
2Dec 29, 2024 21:01103,242283,313,059253,102,0005,002,0002,404,352
3Dec 29, 2024 21:01103,628280,922,039256,071,0003,000,0002,465,792