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 21:03Elijah KinElijah KinScore: 2,660Success
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 21:042,52115,322,9755,199,0001,105,0002,117,632
2Jun 5, 2026 21:042,57315,495,4565,316,0001,117,0002,117,632
3Jun 5, 2026 21:042,63915,666,2065,484,0001,114,0002,117,632
4Jun 5, 2026 21:042,65615,729,8875,533,0001,107,0002,117,632
5Jun 5, 2026 21:042,66015,669,4945,539,0001,112,0002,117,632
6Jun 5, 2026 21:042,74215,878,1725,728,0001,127,0002,117,632
7Jun 5, 2026 21:042,74415,906,3245,745,0001,116,0002,117,632
8Jun 5, 2026 21:042,77116,739,4815,800,0001,128,0002,117,632
9Jun 5, 2026 21:042,77326,580,0135,677,0001,257,0002,117,632