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 12:09Dominique GarmierDominique GarmierScore: 12,399Success
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 12:0912,34357,375,94527,872,0002,986,0002,478,080
2Mar 19, 2026 12:0912,39961,049,55924,999,0005,999,0002,273,280
3Mar 19, 2026 12:0912,43654,889,16527,079,0004,011,0002,502,656