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

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 12:33Tomislav Tunkovic10.00CustomSolution Broken
Sep 4, 2026 11:25Tomislav Tunkovic10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 12:33034,231,7093,684,0001,350,0002,117,632pos 508: expected 0 got 255
2Sep 9, 2026 12:33022,165,8893,731,0001,166,0002,117,632pos 720: expected 0 got 255
3Aug 14, 2026 18:221,77512,687,8023,220,0001,218,0002,117,632
4Aug 14, 2026 18:221,85012,808,7103,472,0001,154,0002,117,632
5Aug 14, 2026 18:221,90614,292,4673,617,0001,149,0002,117,632
6Aug 14, 2026 18:221,94213,028,1353,703,0001,153,0002,117,632
7Aug 14, 2026 18:221,94813,433,8723,684,0001,186,0002,117,632
8Aug 14, 2026 18:221,95813,124,1773,749,0001,146,0002,117,632
9Aug 14, 2026 18:221,96814,020,4023,762,0001,160,0002,117,632
10Aug 14, 2026 18:221,97014,019,1063,768,0001,158,0002,117,632
11Sep 9, 2026 12:331,97221,364,6393,749,0001,181,0002,117,632
12Aug 14, 2026 18:221,98613,994,9133,770,0001,196,0002,117,632