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:27Andrew EpsteinAndrew EpsteinScore: 1,224Success
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 23:311,17312,028,9252,933,00002,117,632
2Nov 2, 2026 23:311,17411,989,7582,936,00002,117,632
3Nov 2, 2026 23:311,17611,931,6582,940,00002,117,632
4Nov 2, 2026 23:311,17612,000,7182,940,00002,117,632
5Nov 2, 2026 23:311,22412,074,8852,036,0001,025,0002,117,632
6Nov 2, 2026 23:311,25612,047,9443,142,00002,117,632
7Nov 2, 2026 23:311,29412,435,3082,217,0001,018,0002,117,632
8Nov 2, 2026 23:311,29811,962,3301,889,0001,357,0002,117,632
9Nov 2, 2026 23:311,31912,230,1232,240,0001,059,0002,117,632