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 3, 2026 00:12Andrew EpsteinAndrew EpsteinScore: 1,165Success
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:231,16212,083,4572,906,0000524,288
2Nov 3, 2026 00:231,16212,116,8642,907,0000524,288
3Nov 3, 2026 00:231,16311,984,5572,909,0000524,288
4Nov 3, 2026 00:231,16312,012,2522,908,0000524,288
5Nov 3, 2026 00:231,16512,040,0442,914,0000524,288
6Nov 3, 2026 00:231,23712,261,2693,094,0000524,288
7Nov 3, 2026 00:231,28422,497,2383,211,0000524,288
8Nov 3, 2026 00:231,32122,690,9743,303,0000524,288
9Nov 3, 2026 00:231,37224,805,7022,350,0001,080,000524,288