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 15, 2026 10:45Tomislav TunkovicTomislav TunkovicScore: 2,330Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 10:462,00213,453,0983,940,0001,066,0002,117,632
2Aug 15, 2026 10:462,17613,874,7824,381,0001,060,0002,117,632
3Aug 15, 2026 10:462,18613,882,8924,403,0001,064,0002,117,632
4Aug 15, 2026 10:462,19213,648,2454,392,0001,088,0002,117,632
5Aug 15, 2026 10:462,33013,979,5164,755,0001,072,0002,117,632
6Aug 15, 2026 10:462,34014,072,9274,761,0001,091,0002,117,632
7Aug 15, 2026 10:462,34414,355,9024,777,0001,084,0002,117,632
8Aug 15, 2026 10:462,35414,335,8374,794,0001,091,0002,117,632
9Aug 15, 2026 10:462,36214,093,6534,799,0001,107,0002,117,632