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 19, 2026 11:04M-RochatM-RochatScore: 55,077Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 11:0555,024146,874,746135,512,0002,048,0002,117,632
2May 19, 2026 11:0555,056146,951,388135,632,0002,010,0002,117,632
3May 19, 2026 11:0555,058147,985,518135,642,0002,005,0002,117,632
4May 19, 2026 11:0555,071147,014,332135,630,0002,049,0002,117,632
5May 19, 2026 11:0555,077147,020,395135,642,0002,052,0002,117,632
6May 19, 2026 11:0555,508148,225,326136,727,0002,043,0002,117,632
7May 19, 2026 11:0555,516149,409,491136,785,0002,005,0002,117,632
8May 19, 2026 11:0555,541148,129,647136,802,0002,052,0002,117,632
9May 19, 2026 11:0555,563149,534,455136,872,0002,036,0002,117,632