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:43M-RochatM-RochatScore: 4,737Success
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:444,55623,025,74110,304,0001,086,0002,113,536
2May 22, 2026 09:444,56020,746,07510,312,0001,089,0002,113,536
3May 22, 2026 09:444,73321,084,95610,736,0001,097,0002,113,536
4May 22, 2026 09:444,73521,143,96810,740,0001,098,0002,117,632
5May 22, 2026 09:444,73721,243,91210,744,0001,099,0002,113,536
6May 22, 2026 09:444,75121,727,55210,779,0001,099,0002,113,536
7May 22, 2026 09:444,76421,790,20710,813,0001,098,0002,113,536
8May 22, 2026 09:444,76421,811,10910,811,0001,100,0002,113,536
9May 22, 2026 09:444,76621,817,6439,894,0002,022,0002,113,536