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 listJun 5, 2026 00:26Elijah KinElijah KinScore: 2,718Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 00:282,68215,719,7405,539,0001,166,0002,117,632
2Jun 5, 2026 00:282,69615,803,5185,565,0001,177,0002,117,632
3Jun 5, 2026 00:282,69815,770,5145,572,0001,174,0002,117,632
4Jun 5, 2026 00:282,71016,080,3935,588,0001,188,0002,117,632
5Jun 5, 2026 00:282,71815,743,5175,636,0001,160,0002,117,632
6Jun 5, 2026 00:282,71915,818,3465,632,0001,167,0002,117,632
7Jun 5, 2026 00:282,73415,773,6225,657,0001,179,0002,117,632
8Jun 5, 2026 00:282,78416,019,0975,756,0001,205,0002,117,632
9Jun 5, 2026 00:282,84316,602,4165,873,0001,236,0002,117,632