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 22, 2026 16:27Dominique GarmierDominique GarmierScore: 60,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 16:2760,320181,159,490144,809,0005,992,0002,437,120
2Mar 22, 2026 16:2760,754175,205,669142,892,0008,993,0002,498,560
3Mar 22, 2026 16:2761,118177,978,930141,739,00011,057,0002,461,696