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 04:40Elijah KinElijah KinScore: 16,806Success
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 04:4016,68869,644,82838,669,0003,052,0002,310,144
2Mar 15, 2026 04:4016,80670,444,39038,014,0004,001,0002,506,752
3Mar 15, 2026 04:4016,97466,534,64639,403,0003,031,0002,297,856