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:22Dominique GarmierDominique GarmierScore: 51,118Success
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:2251,011154,943,260123,511,0004,016,0002,445,312
2Mar 15, 2026 11:2251,118153,949,530120,808,0006,988,0002,310,144
3Mar 15, 2026 11:2251,224154,751,677121,057,0007,003,0002,306,048