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 24, 2026 15:42Dominique GarmierDominique GarmierScore: 42,738Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 15:4242,442134,560,52697,096,0009,008,0002,519,040
2Mar 24, 2026 15:4242,738134,576,41096,859,0009,985,0002,523,136
3Mar 24, 2026 15:4243,933145,449,971104,840,0004,992,0002,506,752