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 14, 2026 00:59Andrew EpsteinAndrew EpsteinScore: 1,369Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 01:001,28611,588,0983,215,0000524,288
2Sep 14, 2026 01:001,29011,572,2703,225,0000524,288
3Sep 14, 2026 01:001,29011,592,7313,227,0000524,288
4Sep 14, 2026 01:001,29611,591,9273,240,0000524,288
5Sep 14, 2026 01:001,36911,786,5333,423,0000524,288
6Sep 14, 2026 01:001,40111,836,4893,503,0000524,288
7Sep 14, 2026 01:001,40211,753,5743,505,0000524,288
8Sep 14, 2026 01:001,41012,027,7613,527,0000524,288
9Sep 14, 2026 01:001,43012,274,6373,577,0000524,288