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:41Andrew EpsteinAndrew EpsteinScore: 1,227Success
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:441,13911,917,7942,849,0000524,288
2Nov 3, 2026 00:441,14311,977,5402,858,0000524,288
3Nov 3, 2026 00:441,14411,888,4732,861,0000524,288
4Nov 3, 2026 00:441,14811,962,1472,872,0000524,288
5Nov 3, 2026 00:441,22712,133,6833,069,0000524,288
6Nov 3, 2026 00:441,24012,147,7283,101,0000524,288
7Nov 3, 2026 00:441,24012,198,8493,102,0000524,288
8Nov 3, 2026 00:441,24212,159,8323,107,0000524,288
9Nov 3, 2026 00:441,24412,211,6293,112,0000524,288