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:29Andrew EpsteinAndrew EpsteinScore: 1,268Success
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:341,25812,227,8183,147,0000524,288
2Nov 3, 2026 00:341,26312,179,4723,159,0000524,288
3Nov 3, 2026 00:341,26312,217,5603,159,0000524,288
4Nov 3, 2026 00:341,26512,302,6653,164,0000524,288
5Nov 3, 2026 00:341,26812,210,3133,172,0000524,288
6Nov 3, 2026 00:341,26812,213,6523,171,0000524,288
7Nov 3, 2026 00:341,27012,250,3753,176,0000524,288
8Nov 3, 2026 00:341,27012,211,6123,176,0000524,288
9Nov 3, 2026 00:341,27012,318,3913,176,0000524,288