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 09:54M-RochatM-RochatScore: 4,673Success
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 09:544,54720,675,98710,280,0001,089,0002,117,632
2May 22, 2026 09:544,55620,723,25310,302,0001,089,0002,117,632
3May 22, 2026 09:544,55823,611,27910,308,0001,088,0002,117,632
4May 22, 2026 09:544,66820,930,97110,573,0001,099,0002,117,632
5May 22, 2026 09:544,67320,953,18410,585,0001,098,0002,117,632
6May 22, 2026 09:544,68520,933,40110,615,0001,098,0002,117,632
7May 22, 2026 09:544,69721,345,42910,643,0001,101,0002,117,632
8May 22, 2026 09:544,70121,510,21810,652,0001,101,0002,117,632
9May 22, 2026 09:544,70323,160,83810,659,0001,099,0002,117,632