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:46Andrew EpsteinAndrew EpsteinScore: 1,263Success
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:511,17111,998,4702,929,0000524,288
2Nov 3, 2026 00:511,25412,179,1113,136,0000524,288
3Nov 3, 2026 00:511,25512,229,3323,139,0000524,288
4Nov 3, 2026 00:511,26012,166,4753,150,0000524,288
5Nov 3, 2026 00:511,26312,204,0633,159,0000524,288
6Nov 3, 2026 00:511,26412,268,1753,160,0000524,288
7Nov 3, 2026 00:511,26812,206,9063,172,0000524,288
8Nov 3, 2026 00:511,26812,233,3133,170,0000524,288
9Nov 3, 2026 00:511,26912,266,9483,173,0000524,288