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 23:57Andrew EpsteinAndrew EpsteinScore: 1,269Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 00:031,16612,108,1132,916,0000524,288
2Nov 3, 2026 00:031,26612,717,1573,167,0000524,288
3Nov 3, 2026 00:031,26612,693,2013,165,0000524,288
4Nov 3, 2026 00:031,26912,323,3463,173,0000524,288
5Nov 3, 2026 00:031,26912,211,5823,173,0000524,288
6Nov 3, 2026 00:031,27012,783,5483,175,0000524,288
7Nov 3, 2026 00:031,27112,744,0233,178,0000524,288
8Nov 3, 2026 00:031,27212,752,5383,180,0000524,288
9Nov 3, 2026 00:031,27912,744,0633,199,0000524,288