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:34Tomislav TunkovicTomislav TunkovicScore: 2,334Success
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:352,07313,716,7723,984,0001,199,0002,117,632
2Aug 15, 2026 10:352,13413,530,3764,260,0001,077,0002,117,632
3Aug 15, 2026 10:352,22214,035,4524,486,0001,070,0002,117,632
4Aug 15, 2026 10:352,32614,028,9414,751,0001,065,0002,117,632
5Aug 15, 2026 10:352,33414,251,7864,783,0001,054,0002,117,632
6Aug 15, 2026 10:352,33514,889,8684,784,0001,055,0002,117,632
7Aug 15, 2026 10:352,36314,359,2434,841,0001,067,0002,117,632
8Aug 15, 2026 10:352,37526,993,9444,863,0001,075,0002,113,536
9Aug 15, 2026 10:352,40514,251,0104,788,0001,225,0002,117,632