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:41Elijah KinElijah KinScore: 22,820Success
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:4122,61183,134,00156,528,00002,306,048
2Mar 15, 2026 01:4122,82081,230,71956,049,0001,000,0002,322,432
3Mar 15, 2026 01:4122,87584,771,00755,182,0002,006,0002,318,336