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:55Elijah KinElijah KinScore: 20,385Success
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:5520,10873,390,48447,253,0003,016,0002,519,040
2Mar 15, 2026 02:5520,38577,890,98245,967,0004,996,0002,297,856
3Mar 15, 2026 02:5520,61480,065,18448,503,0003,031,0002,510,848