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:46Elijah KinElijah KinScore: 13,272Success
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:4613,24464,519,92431,105,0002,006,0002,514,944
2Mar 15, 2026 05:4613,27260,495,51530,164,0003,016,0002,523,136
3Mar 15, 2026 05:4613,28153,769,40129,179,0004,024,0002,523,136