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 16, 2026 23:14M-RochatM-RochatScore: 4,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 23:144,40319,699,0189,935,0001,074,0002,113,536
2May 16, 2026 23:144,40819,722,5609,950,0001,072,0002,121,728
3May 16, 2026 23:144,40919,706,0419,953,0001,071,0002,117,632
4May 16, 2026 23:144,40920,019,5549,949,0001,074,0002,113,536
5May 16, 2026 23:144,41419,718,6409,963,0001,074,0002,121,728
6May 16, 2026 23:144,41619,731,7329,970,0001,072,0002,117,632
7May 16, 2026 23:144,42121,518,4429,981,0001,073,0002,117,632
8May 16, 2026 23:144,42319,726,7119,983,0001,075,0002,117,632
9May 16, 2026 23:144,47219,886,91410,096,0001,085,0002,117,632