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,242Success
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:051,16012,048,9652,901,0000524,288
2Nov 3, 2026 00:051,16112,070,5632,903,0000524,288
3Nov 3, 2026 00:051,16711,984,3622,919,0000524,288
4Nov 3, 2026 00:051,23012,262,6613,075,0000524,288
5Nov 3, 2026 00:051,24212,428,1643,105,0000524,288
6Nov 3, 2026 00:051,25412,474,8563,137,0000524,288
7Nov 3, 2026 00:051,26012,712,9243,150,0000524,288
8Nov 3, 2026 00:051,26412,789,5353,161,0000524,288
9Nov 3, 2026 00:051,26412,339,3293,162,0000524,288