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 22:03Elijah KinElijah KinScore: 2,884Success
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 22:042,64015,869,7015,461,0001,140,0002,121,728
2Jun 5, 2026 22:042,78716,150,4645,832,0001,137,0002,121,728
3Jun 5, 2026 22:042,82816,513,5345,913,0001,157,0002,121,728
4Jun 5, 2026 22:042,84616,812,1045,966,0001,150,0002,121,728
5Jun 5, 2026 22:042,88416,931,4036,071,0001,141,0002,121,728
6Jun 5, 2026 22:042,88816,968,0686,070,0001,152,0002,121,728
7Jun 5, 2026 22:042,90216,911,6526,085,0001,171,0002,121,728
8Jun 5, 2026 22:042,91017,011,2986,105,0001,170,0002,121,728
9Jun 5, 2026 22:042,93216,786,7636,173,0001,159,0002,121,728