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 24, 2023 19:50Kenneth MaplesKenneth MaplesScore: 275,025Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2023 19:50274,996750,929,068687,490,16002,277,376
2Dec 24, 2023 19:50275,025756,132,031687,562,07002,236,416
3Dec 24, 2023 19:50275,279761,335,007688,198,30702,232,320