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 06:02Elijah KinElijah KinScore: 13,025Success
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 06:0212,82254,130,82728,049,0004,007,0002,297,856
2Mar 15, 2026 06:0213,02554,748,31726,458,0006,105,0002,306,048
3Mar 15, 2026 06:0213,06258,020,12430,614,0002,040,0002,301,952