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 18:23marko1597marko1597Error
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 12:33Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 12:35013,410,1083,499,0001,259,0002,117,632pos 250612: expected 255 got 0
2Sep 9, 2026 12:35013,378,6763,488,0001,250,0002,117,632pos 52: expected 0 got 255
3Aug 14, 2026 18:241,92313,253,5313,486,0001,323,0002,117,632
4Aug 14, 2026 18:241,95422,186,1903,541,0001,345,0002,117,632
5Aug 14, 2026 18:241,96213,297,5633,607,0001,298,0002,117,632
6Aug 14, 2026 18:241,97613,322,8883,627,0001,315,0002,117,632
7Aug 14, 2026 18:242,01213,344,6613,741,0001,290,0002,117,632
8Aug 14, 2026 18:242,02914,221,1623,783,0001,290,0002,117,632
9Aug 14, 2026 18:242,02914,071,1183,779,0001,294,0002,117,632
10Sep 9, 2026 12:352,03213,678,5403,790,0001,291,0002,117,632
11Aug 14, 2026 18:242,03614,110,4743,796,0001,294,0002,117,632
12Aug 14, 2026 18:242,06313,617,3553,825,0001,333,0002,117,632