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 19, 2026 18:37Dominique GarmierDominique GarmierScore: 11,966Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 18:3711,95460,004,43826,897,0002,988,0002,486,272
2Mar 19, 2026 18:3711,96655,074,63026,822,0003,094,0002,498,560
3Mar 19, 2026 18:3712,02053,713,60725,043,0005,008,0002,293,760