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:21Elijah KinElijah KinScore: 2,634Success
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:222,53815,560,6745,227,0001,120,0002,117,632
2Jun 5, 2026 20:222,58015,485,7845,330,0001,121,0002,117,632
3Jun 5, 2026 20:222,60815,542,4235,401,0001,120,0002,117,632
4Jun 5, 2026 20:222,62515,665,5045,443,0001,120,0002,117,632
5Jun 5, 2026 20:222,63415,762,0075,473,0001,113,0002,117,632
6Jun 5, 2026 20:222,70915,892,7815,668,0001,106,0002,117,632
7Jun 5, 2026 20:222,77715,927,2845,822,0001,121,0002,117,632
8Jun 5, 2026 20:222,78416,548,4315,835,0001,126,0002,117,632
9Jun 5, 2026 20:222,81716,245,3595,918,0001,125,0002,117,632