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 8, 2026 23:06Elijah KinElijah KinScore: 2,363Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 23:072,27314,849,8934,422,0001,261,0002,117,632
2Jun 8, 2026 23:072,28514,804,8254,457,0001,257,0002,117,632
3Jun 8, 2026 23:072,32014,865,1394,528,0001,273,0002,117,632
4Jun 8, 2026 23:072,35114,974,2454,621,0001,257,0002,117,632
5Jun 8, 2026 23:072,36315,146,0044,662,0001,246,0002,117,632
6Jun 8, 2026 23:072,37315,150,3784,676,0001,258,0002,117,632
7Jun 8, 2026 23:072,38914,993,7894,735,0001,239,0002,117,632
8Jun 8, 2026 23:072,40015,516,8524,728,0001,272,0002,117,632
9Jun 8, 2026 23:072,40715,079,1254,769,0001,249,0002,117,632