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 21, 2026 14:07Dominique GarmierDominique GarmierScore: 11,336Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 14:0711,16054,099,69724,911,0002,989,0002,490,368
2Mar 21, 2026 14:0711,33653,242,59624,292,0004,048,0002,473,984
3Mar 21, 2026 14:0711,35851,750,79924,340,0004,056,0002,449,408