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 02:44Elijah KinElijah KinScore: 16,704Success
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 02:4416,69172,909,58239,692,0002,035,0002,306,048
2Mar 15, 2026 02:4416,70466,401,06839,723,0002,037,0002,265,088
3Mar 15, 2026 02:4416,90867,082,95339,252,0003,019,0002,306,048