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:56M-RochatM-RochatScore: 4,699Success
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:564,56320,689,20410,320,0001,089,0002,121,728
2May 22, 2026 09:564,56820,687,71010,330,0001,092,0002,121,728
3May 22, 2026 09:564,68823,797,87610,620,0001,100,0002,117,632
4May 22, 2026 09:564,69221,546,42810,631,0001,100,0002,117,632
5May 22, 2026 09:564,69921,742,53510,648,0001,101,0002,117,632
6May 22, 2026 09:564,70221,064,12910,658,0001,097,0002,117,632
7May 22, 2026 09:564,70521,871,08710,663,0001,100,0002,121,728
8May 22, 2026 09:564,71421,561,79410,686,0001,099,0002,117,632
9May 22, 2026 09:564,72421,051,89610,713,0001,099,0002,117,632