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 14, 2026 17:30marko1597marko1597Score: 2,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 17:312,62114,760,7965,392,0001,161,0002,117,632
2Aug 14, 2026 17:312,69015,079,9235,526,0001,199,0002,117,632
3Aug 14, 2026 17:312,72815,296,3395,597,0001,224,0002,117,632
4Aug 14, 2026 17:312,75315,087,7325,636,0001,248,0002,117,632
5Aug 14, 2026 17:312,77215,354,8095,716,0001,215,0002,117,632
6Aug 14, 2026 17:312,77315,173,0885,682,0001,251,0002,117,632
7Aug 14, 2026 17:312,77515,374,0885,716,0001,222,0002,117,632
8Aug 14, 2026 17:312,80716,205,2255,790,0001,229,0002,117,632
9Aug 14, 2026 17:312,80715,318,6575,787,0001,231,0002,117,632