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 listOct 9, 2026 08:52Karthik ReddyKarthik ReddyScore: 1,243Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 10:021,22812,027,3051,837,0001,235,000524,288
2Oct 9, 2026 10:021,23011,698,0411,837,0001,240,000524,288
3Oct 9, 2026 10:021,23311,691,7051,838,0001,246,000524,288
4Oct 9, 2026 10:021,23411,656,6211,575,0001,510,000524,288
5Oct 9, 2026 10:021,24311,710,0881,859,0001,250,000524,288
6Oct 9, 2026 10:021,30811,902,4982,024,0001,248,000524,288
7Oct 9, 2026 10:021,38512,153,1122,304,0001,160,000524,288
8Oct 9, 2026 10:021,39812,092,5982,345,0001,152,000524,288
9Oct 9, 2026 10:021,45112,180,8982,484,0001,144,000524,288