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:17Andrew EpsteinAndrew EpsteinScore: 1,226Success
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:281,13312,080,3582,834,0000524,288
2Nov 3, 2026 00:281,13612,053,4042,842,0000524,288
3Nov 3, 2026 00:281,13612,034,9092,840,0000524,288
4Nov 3, 2026 00:281,13711,999,6342,844,0000524,288
5Nov 3, 2026 00:281,22612,238,2903,067,0000524,288
6Nov 3, 2026 00:281,23012,255,1183,075,0000524,288
7Nov 3, 2026 00:281,23212,262,1423,082,0000524,288
8Nov 3, 2026 00:281,23412,296,1683,086,0000524,288
9Nov 3, 2026 00:281,23412,626,1753,087,0000524,288