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 17:36Dominique GarmierDominique GarmierScore: 11,624Success
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 17:3611,40853,804,71924,445,0004,074,0002,531,328
2Mar 19, 2026 17:3611,62455,198,37026,054,0003,006,0002,322,432
3Mar 19, 2026 17:3611,68957,936,53525,192,0004,030,0002,514,944