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 00:26Elijah KinElijah KinScore: 492,522Success
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 00:26492,4471,260,240,6271,230,119,000999,0002,310,144
2Mar 15, 2026 00:26492,5221,257,304,0281,228,308,0002,998,0002,301,952
3Mar 15, 2026 00:26492,6141,258,494,4891,230,536,000999,0002,322,432