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 07:34Elijah KinElijah KinScore: 12,914Success
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 07:3412,90059,114,69428,220,0004,031,0002,301,952
2Mar 15, 2026 07:3412,91456,008,65229,259,0003,026,0002,301,952
3Mar 15, 2026 07:3412,91562,044,66028,252,0004,036,0002,306,048