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 00:58Elijah KinElijah KinScore: 2,608Success
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 01:012,58015,456,3635,323,0001,128,0002,117,632
2Jun 4, 2026 01:012,58215,467,3995,325,0001,130,0002,117,632
3Jun 4, 2026 01:012,59515,538,1065,339,0001,149,0002,117,632
4Jun 4, 2026 01:012,60315,573,6465,377,0001,132,0002,117,632
5Jun 4, 2026 01:012,60815,541,1055,388,0001,134,0002,117,632
6Jun 4, 2026 01:012,62815,564,6555,388,0001,183,0002,117,632
7Jun 4, 2026 01:012,62817,658,6325,411,0001,160,0002,117,632
8Jun 4, 2026 01:012,68317,411,0185,591,0001,117,0002,117,632
9Jun 4, 2026 01:012,76716,335,3965,760,0001,159,0002,117,632