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:40Elijah KinElijah KinScore: 23,054Success
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:4022,84282,829,75755,102,0002,003,0002,306,048
2Mar 15, 2026 03:4023,05482,297,75855,613,0002,022,0002,265,088
3Mar 15, 2026 03:4023,14383,408,19455,863,0001,995,0002,387,968