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:25M-RochatM-RochatScore: 4,584Success
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:264,55120,682,22110,289,0001,089,0002,117,632
2May 20, 2026 16:264,55220,686,47610,294,0001,088,0002,117,632
3May 20, 2026 16:264,55520,730,45410,302,0001,086,0002,117,632
4May 20, 2026 16:264,55920,831,78710,309,0001,090,0002,121,728
5May 20, 2026 16:264,58420,782,61710,369,0001,091,0002,121,728
6May 20, 2026 16:264,67523,657,38210,590,0001,099,0002,117,632
7May 20, 2026 16:264,67821,579,46010,598,0001,098,0002,117,632
8May 20, 2026 16:264,69221,569,06010,634,0001,097,0002,117,632
9May 20, 2026 16:264,78224,587,6109,919,0002,037,0002,117,632