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:04Elijah KinElijah KinScore: 12,769Success
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:0412,75955,925,98427,910,0003,987,0002,301,952
2Mar 15, 2026 06:0412,76958,476,10527,803,0004,119,0002,310,144
3Mar 15, 2026 06:0412,91855,630,67528,258,0004,036,0002,289,664