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 01:23Elijah KinElijah KinScore: 22,809Success
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 01:2322,47580,844,54254,182,0002,006,0002,310,144
2Mar 15, 2026 01:2322,80986,827,45154,021,0003,001,0002,314,240
3Mar 15, 2026 01:2322,87486,816,89456,182,0001,003,0002,301,952