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 3, 2026 20:46Elijah KinElijah KinScore: 2,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 20:492,87416,213,4816,067,0001,120,0002,117,632
2Jun 3, 2026 20:492,89116,245,6196,109,0001,119,0002,117,632
3Jun 3, 2026 20:492,91716,329,9006,140,0001,154,0002,117,632
4Jun 3, 2026 20:492,92617,827,4186,162,0001,153,0002,117,632
5Jun 3, 2026 20:492,95616,364,8416,257,0001,135,0002,117,632
6Jun 3, 2026 20:492,97116,546,3266,289,0001,139,0002,117,632
7Jun 3, 2026 20:493,00218,560,5266,342,0001,164,0002,117,632
8Jun 3, 2026 20:493,01216,567,2236,352,0001,179,0002,117,632
9Jun 3, 2026 20:493,02617,001,2096,412,0001,154,0002,117,632