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 19, 2026 20:39Dominique GarmierDominique GarmierScore: 11,699Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 20:3911,44555,052,17726,570,0002,043,0002,416,640
2Mar 19, 2026 20:3911,69950,486,87426,223,0003,025,0002,285,568
3Mar 19, 2026 20:3911,78850,153,35325,406,0004,064,0002,424,832