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 listNov 2, 2026 21:20Andrew EpsteinAndrew EpsteinScore: 12,775Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2026 21:2112,65740,923,48930,532,0001,112,0002,117,632stderr
2Nov 2, 2026 21:2112,66640,836,16130,551,0001,116,0002,117,632stderr
3Nov 2, 2026 21:2112,66741,037,34630,565,0001,104,0002,117,632stderr
4Nov 2, 2026 21:2112,76341,107,29230,766,0001,143,0002,117,632stderr
5Nov 2, 2026 21:2112,77541,175,00330,820,0001,118,0002,117,632stderr
6Nov 2, 2026 21:2112,77841,149,09030,845,0001,100,0002,117,632stderr
7Nov 2, 2026 21:2112,83341,275,28730,951,0001,133,0002,117,632stderr
8Nov 2, 2026 21:2112,83541,368,39230,980,0001,108,0002,117,632stderr
9Nov 2, 2026 21:2112,84741,402,22730,972,0001,147,0002,117,632stderr