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 listSep 17, 2026 20:12Andrew EpsteinAndrew EpsteinScore: 1,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 20:251,39811,890,4743,497,0000524,288
2Sep 17, 2026 20:251,39911,927,5263,498,0000524,288
3Sep 17, 2026 20:251,40111,922,3403,503,0000524,288
4Sep 17, 2026 20:251,40111,940,3853,504,0000524,288
5Sep 17, 2026 20:251,40211,895,8083,505,0000524,288
6Sep 17, 2026 20:251,40311,945,0533,509,0000524,288
7Sep 17, 2026 20:251,40411,950,1563,511,0000524,288
8Sep 17, 2026 20:251,40711,894,6783,518,0000524,288
9Sep 17, 2026 20:251,46212,046,6213,656,0000524,288