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 15, 2026 01:28Elijah KinElijah KinScore: 38,669Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 01:2838,640120,733,83295,594,0001,006,0002,514,944
2Mar 15, 2026 01:2838,669127,100,51594,659,0002,014,0002,433,024
3Mar 15, 2026 01:2838,707121,802,05692,778,0003,990,0002,506,752