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 11:32Dominique GarmierDominique GarmierScore: 11,207Success
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 11:3211,15459,235,68022,907,0004,979,0002,486,272
2Mar 20, 2026 11:3211,20754,245,03623,014,0005,003,0002,375,680
3Mar 20, 2026 11:3211,27051,519,61123,145,0005,031,0002,297,856