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 10:41Karthik ReddyKarthik ReddyScore: 1,484Success
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:581,26212,006,2871,870,0001,286,000524,288
2Oct 9, 2026 10:581,27712,012,8561,930,0001,264,000524,288
3Oct 9, 2026 10:581,28111,990,5361,936,0001,267,000524,288
4Oct 9, 2026 10:581,46612,354,7422,524,0001,141,000524,288
5Oct 9, 2026 10:581,48412,489,2442,584,0001,126,000524,288
6Oct 9, 2026 10:581,48812,510,4452,584,0001,136,000524,288
7Oct 9, 2026 10:581,51112,450,8952,555,0001,223,000524,288
8Oct 9, 2026 10:581,51612,515,2812,656,0001,134,000524,288
9Oct 9, 2026 10:581,52013,107,4562,670,0001,132,000524,288