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 listJan 29, 2025 14:45KeefeKeefeScore: 28,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2025 14:4528,44998,599,15064,110,0007,012,0002,293,760
2Jan 29, 2025 14:4528,71297,397,11362,808,0008,972,0002,289,664
3Jan 29, 2025 14:4528,714101,972,59063,810,0007,976,0002,461,696
4Jan 29, 2025 14:4528,896100,451,39864,213,0008,026,0002,412,544
5Jan 29, 2025 14:4528,975100,480,26268,413,0004,024,0002,359,296
6Jan 29, 2025 14:4529,122103,846,89065,824,0006,981,0002,338,816
7Jan 29, 2025 14:4529,193104,294,75664,984,0007,998,0002,289,664
8Jan 29, 2025 14:4529,214102,729,21366,033,0007,003,0002,330,624
9Jan 29, 2025 14:4529,907109,738,75566,792,0007,975,0002,293,760