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 listMar 15, 2026 04:59Elijah KinElijah KinScore: 12,765Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 04:5912,75762,904,07326,910,0004,983,0002,310,144
2Mar 15, 2026 04:5912,75859,700,02628,905,0002,990,0002,297,856
3Mar 15, 2026 04:5912,76055,482,52629,906,0001,993,0002,482,176
4Mar 15, 2026 04:5912,76457,942,69225,928,0005,983,0002,482,176
5Mar 15, 2026 04:5912,76560,019,80529,918,0001,994,0002,314,240
6Mar 15, 2026 04:5912,78760,540,45426,973,0004,995,0002,297,856
7Mar 15, 2026 04:5912,79463,088,44327,988,0003,998,0002,306,048
8Mar 15, 2026 04:5912,96162,615,87828,352,0004,050,0002,424,832
9Mar 15, 2026 04:5913,01058,284,61830,492,0002,032,0002,334,720