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:06Elijah KinElijah KinScore: 22,940Success
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:0622,87684,578,03656,187,0001,003,0002,306,048
2Mar 15, 2026 02:0622,94082,855,71756,345,0001,006,0002,306,048
3Mar 15, 2026 02:0622,94585,993,59654,344,0003,019,0002,265,088