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:32Elijah KinElijah KinScore: 2,234Success
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:332,03717,004,2253,888,0001,206,0002,117,632
2Jun 9, 2026 04:332,05314,314,3673,918,0001,215,0002,117,632
3Jun 9, 2026 04:332,05814,249,9123,940,0001,207,0002,117,632
4Jun 9, 2026 04:332,22314,692,3374,349,0001,209,0002,117,632
5Jun 9, 2026 04:332,23414,708,3524,382,0001,205,0002,117,632
6Jun 9, 2026 04:332,30414,881,9624,561,0001,201,0002,117,632
7Jun 9, 2026 04:332,35214,908,7964,682,0001,198,0002,117,632
8Jun 9, 2026 04:332,38315,053,6784,758,0001,200,0002,117,632
9Jun 9, 2026 04:332,40515,044,8134,749,0001,264,0002,117,632