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 17:42marko1597marko1597Score: 2,684Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 12:36Tomislav Tunkovic11.83CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 17:422,65714,990,9865,477,0001,166,0002,117,632
2Aug 14, 2026 17:422,66214,855,1375,489,0001,167,0002,117,632
3Aug 14, 2026 17:422,66614,899,0965,496,0001,169,0002,117,632
4Aug 14, 2026 17:422,68015,058,0675,533,0001,167,0002,117,632
5Aug 14, 2026 17:422,68414,877,9305,541,0001,171,0002,117,632
6Aug 14, 2026 17:422,69914,966,1545,547,0001,202,0002,117,632
7Aug 14, 2026 17:422,72415,229,5205,617,0001,193,0002,117,632
8Aug 14, 2026 17:422,74815,062,6275,631,0001,240,0002,117,632
9Aug 14, 2026 17:422,80015,263,7635,763,0001,238,0002,117,632