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 7, 2026 03:56Elijah KinElijah KinScore: 2,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 03:582,24114,627,8444,486,0001,117,0002,117,632
2Jun 7, 2026 03:582,24314,612,6404,490,0001,118,0002,117,632
3Jun 7, 2026 03:582,25014,648,9704,507,0001,119,0002,117,632
4Jun 7, 2026 03:582,25414,673,6884,516,0001,121,0002,117,632
5Jun 7, 2026 03:582,26814,641,4034,547,0001,125,0002,117,632
6Jun 7, 2026 03:582,39315,082,5344,871,0001,113,0002,117,632
7Jun 7, 2026 03:582,39514,962,3414,873,0001,116,0002,117,632
8Jun 7, 2026 03:582,40114,990,3084,890,0001,113,0002,117,632
9Jun 7, 2026 03:582,46215,275,7835,044,0001,111,0002,117,632