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 20:34Elijah KinElijah KinScore: 2,731Success
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 20:362,55615,506,6795,282,0001,109,0002,117,632
2Jun 5, 2026 20:362,57415,454,2215,324,0001,112,0002,117,632
3Jun 5, 2026 20:362,66415,689,9235,560,0001,102,0002,117,632
4Jun 5, 2026 20:362,71715,878,9115,689,0001,105,0002,117,632
5Jun 5, 2026 20:362,73118,287,7065,716,0001,113,0002,117,632
6Jun 5, 2026 20:362,74216,344,5975,741,0001,114,0002,117,632
7Jun 5, 2026 20:362,78616,477,1745,843,0001,122,0002,117,632
8Jun 5, 2026 20:362,82516,536,9905,942,0001,121,0002,117,632
9Jun 5, 2026 20:362,84416,545,1325,989,0001,121,0002,117,632