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 21:14Elijah KinElijah KinScore: 12,982Success
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 21:1412,94860,476,02529,335,0003,034,0002,314,240
2Mar 15, 2026 21:1412,98256,549,02028,399,0004,057,0002,326,528
3Mar 15, 2026 21:1413,00858,479,45629,472,0003,048,0002,306,048