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 05:21Elijah KinElijah KinScore: 12,883Success
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 05:2112,84263,985,28827,088,0005,016,0002,457,600
2Mar 15, 2026 05:2112,88356,673,61328,182,0004,026,0002,392,064
3Mar 15, 2026 05:2113,05359,332,93027,534,0005,099,0002,306,048