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 12, 2024 23:48Joad NacerJoad NacerScore: 32,831Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 12, 2024 23:4832,801107,355,35880,002,0002,000,0002,433,024
2Dec 12, 2024 23:4832,831101,604,90181,078,0001,000,0002,351,104
3Dec 12, 2024 23:4832,902103,555,36881,251,0001,003,0002,400,256