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 6, 2026 14:23Andrew EpsteinAndrew EpsteinScore: 1,259Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2026 14:251,17013,599,8102,927,0000524,288
2Nov 6, 2026 14:251,17412,079,7012,937,0000524,288
3Nov 6, 2026 14:251,17512,277,5782,938,0000524,288
4Nov 6, 2026 14:251,25412,291,0323,135,0000524,288
5Nov 6, 2026 14:251,25912,225,6803,148,0000524,288
6Nov 6, 2026 14:251,26812,231,1583,172,0000524,288
7Nov 6, 2026 14:251,27112,685,2723,178,0000524,288
8Nov 6, 2026 14:251,27212,688,9993,180,0000524,288
9Nov 6, 2026 14:251,27812,693,5273,195,0000524,288