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 listAug 27, 2026 17:29Elijah KinElijah KinScore: 2,422Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 17:302,34815,733,7774,612,0001,258,0002,117,632
2Aug 27, 2026 17:302,36215,673,3154,811,0001,096,0002,117,632
3Aug 27, 2026 17:302,39015,794,5314,708,0001,268,0002,117,632
4Aug 27, 2026 17:302,41515,846,4564,787,0001,252,0002,117,632
5Aug 27, 2026 17:302,42215,846,2904,787,0001,269,0002,117,632
6Aug 27, 2026 17:302,42815,933,2684,811,0001,260,0002,117,632
7Aug 27, 2026 17:302,43615,811,8024,844,0001,247,0002,117,632
8Aug 27, 2026 17:302,44415,888,6894,862,0001,250,0002,117,632
9Aug 27, 2026 17:302,45416,015,4074,875,0001,262,0002,117,632