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:40Joad NacerJoad NacerScore: 34,398Success
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:4034,296115,140,59882,713,0003,026,0002,404,352
2Dec 10, 2024 23:4034,398113,753,03483,995,0001,999,0002,314,240
3Dec 10, 2024 23:4034,430113,863,21185,076,0001,000,0002,510,848