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 25, 2026 20:29Dominique GarmierDominique GarmierScore: 211,802Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 20:29211,614551,851,524529,035,00002,289,664
2Mar 25, 2026 20:29211,802555,482,094529,506,00002,289,664
3Mar 25, 2026 20:29212,813560,148,470531,032,0001,000,0002,367,488