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 26, 2026 12:01Kevin HeaveyKevin HeaveyScore: 1,457Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 12:011,42312,758,3262,520,0001,039,000520,192
2Sep 26, 2026 12:011,44812,874,0862,428,0001,194,000520,192
3Sep 26, 2026 12:011,45112,849,7292,429,0001,199,000520,192
4Sep 26, 2026 12:011,45212,830,9162,594,0001,038,000520,192
5Sep 26, 2026 12:011,45712,871,5052,436,0001,208,000520,192
6Sep 26, 2026 12:011,45912,227,1032,601,0001,048,000520,192
7Sep 26, 2026 12:011,46912,858,6482,478,0001,195,000520,192
8Sep 26, 2026 12:011,48812,921,5192,628,0001,093,000520,192
9Sep 26, 2026 12:011,50612,989,4872,483,0001,282,000520,192