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 17:36Elijah KinElijah KinScore: 2,810Success
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 17:372,64816,097,4385,527,0001,095,0002,117,632
2Jun 5, 2026 17:372,65015,728,4985,302,0001,323,0002,117,632
3Jun 5, 2026 17:372,68015,778,7265,605,0001,096,0002,117,632
4Jun 5, 2026 17:372,80316,676,2105,904,0001,104,0002,117,632
5Jun 5, 2026 17:372,81016,195,6535,619,0001,406,0002,117,632
6Jun 5, 2026 17:372,81616,156,2175,930,0001,111,0002,117,632
7Jun 5, 2026 17:372,82716,653,8745,960,0001,108,0002,117,632
8Jun 5, 2026 17:372,83516,590,6245,963,0001,125,0002,117,632
9Jun 5, 2026 17:372,86216,645,5946,046,0001,109,0002,117,632