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:43Elijah KinElijah KinScore: 22,869Success
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:4322,61780,579,31754,524,0002,019,0002,306,048
2Mar 15, 2026 02:4322,86985,926,83755,166,0002,006,0002,392,064
3Mar 15, 2026 02:4322,94883,163,45156,365,0001,006,0002,265,088