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 9, 2026 04:28Elijah KinElijah KinScore: 2,888Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 04:292,56815,573,2594,443,0001,978,0002,117,632
2Jun 9, 2026 04:292,60215,554,9904,552,0001,953,0002,117,632
3Jun 9, 2026 04:292,61315,648,9584,481,0002,053,0002,117,632
4Jun 9, 2026 04:292,61515,649,7634,537,0002,001,0002,117,632
5Jun 9, 2026 04:292,88816,268,7735,235,0001,986,0002,117,632
6Jun 9, 2026 04:292,90816,276,0115,305,0001,965,0002,117,632
7Jun 9, 2026 04:293,09616,817,0705,032,0002,708,0002,117,632
8Jun 9, 2026 04:293,13316,947,8755,117,0002,717,0002,117,632
9Jun 9, 2026 04:293,14617,375,0895,654,0002,212,0002,117,632