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 03:54Elijah KinElijah KinScore: 23,044Success
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 03:5422,88082,539,80254,190,0003,010,0002,265,088
2Mar 15, 2026 03:5423,04478,700,08155,589,0002,021,0002,265,088
3Mar 15, 2026 03:5423,04682,465,63556,605,0001,010,0002,506,752