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 21, 2026 16:22Dominique GarmierDominique GarmierScore: 18,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 16:2218,63373,967,12643,545,0003,038,0002,326,528
2Mar 21, 2026 16:2218,65177,039,71842,574,0004,054,0002,359,296
3Mar 21, 2026 16:2218,66974,320,65541,599,0005,073,0002,359,296