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:30M-RochatM-RochatScore: 4,558Success
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:304,54920,770,88810,286,0001,088,0002,117,632
2May 20, 2026 16:304,55020,803,23310,288,0001,088,0002,117,632
3May 20, 2026 16:304,55420,672,37110,298,0001,088,0002,117,632
4May 20, 2026 16:304,55620,714,41010,302,0001,088,0002,121,728
5May 20, 2026 16:304,55820,684,15810,307,0001,088,0002,117,632
6May 20, 2026 16:304,56820,776,40310,330,0001,090,0002,121,728
7May 20, 2026 16:304,68322,998,50610,608,0001,100,0002,117,632
8May 20, 2026 16:304,69621,603,78610,642,0001,100,0002,117,632
9May 20, 2026 16:304,70421,613,59910,658,0001,102,0002,117,632