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 20:37Dominique GarmierDominique GarmierScore: 11,398Success
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 20:3711,38756,603,17624,401,0004,066,0002,273,280
2Mar 19, 2026 20:3711,39852,617,49525,442,0003,053,0002,486,272
3Mar 19, 2026 20:3711,43153,896,00623,475,0005,103,0002,371,584