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 17:40Elijah KinElijah KinScore: 2,737Success
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 17:412,63015,722,1185,483,0001,094,0002,117,632
2Jun 5, 2026 17:412,70216,221,3405,352,0001,405,0002,117,632
3Jun 5, 2026 17:412,72616,385,7245,727,0001,089,0002,117,632
4Jun 5, 2026 17:412,72716,118,3975,722,0001,096,0002,117,632
5Jun 5, 2026 17:412,73716,234,7245,755,0001,089,0002,117,632
6Jun 5, 2026 17:412,75416,368,4065,797,0001,090,0002,117,632
7Jun 5, 2026 17:412,80316,590,3425,919,0001,089,0002,117,632
8Jun 5, 2026 17:412,82316,589,9855,959,0001,099,0002,117,632
9Jun 5, 2026 17:412,83616,677,5155,972,0001,119,0002,117,632