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 13:50Dominique GarmierDominique GarmierScore: 12,392Success
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 13:5012,36062,292,60326,913,0003,987,0002,318,336
2Mar 19, 2026 13:5012,39261,661,67325,984,0004,996,0002,465,792
3Mar 19, 2026 13:5012,61355,092,53627,465,0004,068,0002,387,968