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 3, 2026 16:47Elijah KinElijah KinScore: 2,987Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 16:502,92718,039,0246,136,0001,183,0002,117,632
2Jun 3, 2026 16:502,92716,320,9766,154,0001,165,0002,117,632
3Jun 3, 2026 16:502,93216,296,0136,166,0001,165,0002,117,632
4Jun 3, 2026 16:502,94116,469,8566,174,0001,180,0002,117,632
5Jun 3, 2026 16:502,98716,450,8886,260,0001,209,0002,117,632
6Jun 3, 2026 16:503,04018,472,0626,472,0001,130,0002,117,632
7Jun 3, 2026 16:503,05317,032,0946,496,0001,137,0002,117,632
8Jun 3, 2026 16:503,07218,353,7836,562,0001,120,0002,117,632
9Jun 3, 2026 16:503,09416,737,8626,524,0001,212,0002,117,632