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:41M-RochatM-RochatScore: 4,670Success
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:414,54820,779,96610,282,0001,089,0002,121,728
2May 20, 2026 16:414,56020,691,38510,311,0001,090,0002,121,728
3May 20, 2026 16:414,56920,816,44510,331,0001,092,0002,121,728
4May 20, 2026 16:414,67020,867,29610,578,0001,097,0002,117,632
5May 20, 2026 16:414,67020,887,49910,579,0001,098,0002,117,632
6May 20, 2026 16:414,67220,943,63210,583,0001,098,0002,117,632
7May 20, 2026 16:414,68321,509,90010,608,0001,100,0002,117,632
8May 20, 2026 16:414,70421,567,68510,660,0001,100,0002,117,632
9May 20, 2026 16:414,74221,184,7369,799,0002,058,0002,117,632