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 listApr 19, 2025 02:04KeefeKeefeScore: 23,133Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2025 02:0422,39485,329,33253,986,0001,999,0002,396,160
2Apr 19, 2025 02:0423,13382,643,56354,842,0002,991,0002,396,160
3Apr 19, 2025 02:0423,53588,031,63756,844,0001,994,0002,387,968