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 11:14Dominique GarmierDominique GarmierScore: 43,155Success
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 11:1442,924130,155,381100,290,0007,020,0002,420,736
2Mar 15, 2026 11:1443,155129,656,476100,895,0006,992,0002,519,040
3Mar 15, 2026 11:1443,966138,200,204104,920,0004,996,0002,379,776