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:54Elijah KinElijah KinScore: 18,474Success
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:5418,40573,459,72340,012,0006,001,0002,420,736
2Mar 15, 2026 01:5418,47476,148,02345,181,0001,004,0002,297,856
3Mar 15, 2026 01:5418,54477,457,92343,337,0003,023,0002,314,240