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:41Joad NacerJoad NacerScore: 88,136Success
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:4187,909243,755,629217,775,0001,997,0002,269,184
2Dec 10, 2024 23:4188,136245,416,297218,337,0002,003,0002,396,160
3Dec 10, 2024 23:4188,216245,291,133219,539,0001,002,0002,461,696