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 listMay 20, 2026 16:50M-RochatM-RochatScore: 4,552Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 16:504,54820,716,66910,283,0001,089,0002,117,632
2May 20, 2026 16:504,54920,696,22110,285,0001,088,0002,117,632
3May 20, 2026 16:504,55020,665,23510,287,0001,088,0002,121,728
4May 20, 2026 16:504,55120,710,74310,290,0001,089,0002,121,728
5May 20, 2026 16:504,55220,832,57510,294,0001,088,0002,121,728
6May 20, 2026 16:504,55620,817,67510,303,0001,089,0002,117,632
7May 20, 2026 16:504,56620,666,83710,324,0001,091,0002,121,728
8May 20, 2026 16:504,63235,715,19610,480,0001,102,0002,117,632
9May 20, 2026 16:504,66030,697,31010,528,0001,123,0002,117,632