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 22, 2026 12:54M-RochatM-RochatScore: 4,495Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 12:544,47220,446,87110,098,0001,084,0002,117,632
2May 22, 2026 12:544,48220,962,12410,119,0001,088,0002,121,728
3May 22, 2026 12:544,48620,460,79410,129,0001,087,0002,117,632
4May 22, 2026 12:544,49220,467,86810,143,0001,087,0002,117,632
5May 22, 2026 12:544,49520,541,08310,152,0001,086,0002,117,632
6May 22, 2026 12:544,49820,982,57010,158,0001,088,0002,121,728
7May 22, 2026 12:544,49820,434,87210,160,0001,087,0002,117,632
8May 22, 2026 12:544,50220,445,60110,167,0001,089,0002,117,632
9May 22, 2026 12:544,51320,931,04810,197,0001,087,0002,117,632