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 27, 2026 04:58Elijah KinElijah KinScore: 2,301Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 04:592,01714,228,8293,792,0001,252,0002,117,632
2Jun 27, 2026 04:592,02114,189,9513,803,0001,251,0002,117,632
3Jun 27, 2026 04:592,06214,228,1984,036,0001,120,0002,117,632
4Jun 27, 2026 04:592,22414,665,5134,300,0001,261,0002,117,632
5Jun 27, 2026 04:592,30116,234,5734,494,0001,259,0002,117,632
6Jun 27, 2026 04:592,31114,881,9824,529,0001,249,0002,117,632
7Jun 27, 2026 04:592,31614,823,5164,529,0001,261,0002,117,632
8Jun 27, 2026 04:592,32314,884,2464,533,0001,275,0002,117,632
9Jun 27, 2026 04:592,39115,074,9144,634,0001,344,0002,117,632