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 6, 2026 21:24Elijah KinElijah KinScore: 2,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 21:252,37214,942,1504,805,0001,125,0002,117,632
2Jun 6, 2026 21:252,47615,243,1095,072,0001,119,0002,117,632
3Jun 6, 2026 21:252,49715,556,2755,122,0001,121,0002,117,632
4Jun 6, 2026 21:252,53315,367,3185,215,0001,119,0002,117,632
5Jun 6, 2026 21:252,54015,867,3165,233,0001,118,0002,117,632
6Jun 6, 2026 21:252,54215,366,4145,232,0001,123,0002,117,632
7Jun 6, 2026 21:252,54415,460,5575,247,0001,114,0002,117,632
8Jun 6, 2026 21:252,55015,937,0225,250,0001,126,0002,117,632
9Jun 6, 2026 21:252,56715,469,0115,301,0001,118,0002,117,632