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 4, 2026 16:27Elijah KinElijah KinScore: 2,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2026 16:292,57615,507,2015,257,0001,185,0002,117,632
2Jun 4, 2026 16:292,59815,925,8185,317,0001,179,0002,117,632
3Jun 4, 2026 16:292,61615,576,0905,365,0001,175,0002,117,632
4Jun 4, 2026 16:292,64615,775,4165,453,0001,163,0002,117,632
5Jun 4, 2026 16:292,65417,012,8255,459,0001,178,0002,117,632
6Jun 4, 2026 16:292,67215,998,8785,551,0001,130,0002,117,632
7Jun 4, 2026 16:292,69516,240,5035,541,0001,198,0002,117,632
8Jun 4, 2026 16:292,74016,141,7615,666,0001,186,0002,117,632
9Jun 4, 2026 16:292,79116,455,5225,846,0001,132,0002,117,632