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 20, 2026 07:49Dominique GarmierDominique GarmierScore: 8,826Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 07:498,76047,597,28418,913,0002,986,0002,375,680
2Mar 20, 2026 07:498,82645,188,13418,053,0004,011,0002,285,568
3Mar 20, 2026 07:499,08148,112,14818,575,0004,127,0002,285,568