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:17Tomislav TunkovicTomislav TunkovicScore: 2,080Success
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:181,96313,342,8083,854,0001,054,0002,117,632
2Aug 15, 2026 10:181,96413,326,8263,851,0001,059,0002,117,632
3Aug 15, 2026 10:181,99213,177,2453,889,0001,093,0002,117,632
4Aug 15, 2026 10:182,05213,605,9563,880,0001,250,0002,117,632
5Aug 15, 2026 10:182,08013,374,7214,120,0001,081,0002,117,632
6Aug 15, 2026 10:182,13013,756,4384,258,0001,069,0002,117,632
7Aug 15, 2026 10:182,14813,786,7024,304,0001,066,0002,117,632
8Aug 15, 2026 10:182,27914,112,9944,633,0001,066,0002,117,632
9Aug 15, 2026 10:182,28214,112,1144,623,0001,084,0002,117,632