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 10, 2024 23:42Joad NacerJoad NacerScore: 53,224Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 10, 2024 23:4253,191159,396,118131,979,000999,0002,375,680
2Dec 10, 2024 23:4253,224158,320,528130,060,0003,001,0002,383,872
3Dec 10, 2024 23:4253,272159,662,328131,178,0002,002,0002,519,040