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 19:24Elijah KinElijah KinScore: 2,681Success
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 19:252,58215,501,1395,348,0001,108,0002,117,632
2Jun 4, 2026 19:252,59015,474,4285,358,0001,118,0002,117,632
3Jun 4, 2026 19:252,61215,542,3725,410,0001,122,0002,117,632
4Jun 4, 2026 19:252,64416,029,9755,429,0001,181,0002,117,632
5Jun 4, 2026 19:252,68115,824,2035,556,0001,148,0002,117,632
6Jun 4, 2026 19:252,74815,908,6595,739,0001,132,0002,117,632
7Jun 4, 2026 19:252,75816,402,2395,741,0001,155,0002,117,632
8Jun 4, 2026 19:252,76417,439,8485,739,0001,171,0002,117,632
9Jun 4, 2026 19:252,81816,544,4385,899,0001,147,0002,117,632