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 16, 2026 22:23Dominique GarmierDominique GarmierScore: 14,526Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 22:2314,45060,089,23933,116,0003,010,0002,478,080
2Mar 16, 2026 22:2314,52659,854,23033,290,0003,026,0002,441,216
3Mar 16, 2026 22:2314,70059,584,47132,666,0004,083,0002,490,368