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 01:06Elijah KinElijah KinScore: 36,139Success
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 01:0635,890120,796,32187,709,0002,016,0002,297,856
2Mar 15, 2026 01:0636,139117,923,54086,332,0004,015,0002,297,856
3Mar 15, 2026 01:0636,278120,372,97888,679,0002,015,0002,306,048