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 29, 2026 15:50Victor MerckléVictor MerckléScore: 1,548Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 15:521,51612,124,3062,711,0001,080,0002,117,632stderr
2Aug 29, 2026 15:521,51912,131,9792,718,0001,080,0002,117,632stderr
3Aug 29, 2026 15:521,52012,019,7802,717,0001,083,0002,117,632stderr
4Aug 29, 2026 15:521,52712,181,8832,725,0001,094,0002,117,632stderr
5Aug 29, 2026 15:521,54812,266,4702,769,0001,103,0002,117,632stderr
6Aug 29, 2026 15:521,57512,338,0942,832,0001,106,0002,117,632stderr
7Aug 29, 2026 15:521,62412,347,0642,952,0001,108,0002,117,632stderr
8Aug 29, 2026 15:521,64012,339,9402,967,0001,135,0002,117,632stderr
9Aug 29, 2026 15:521,65112,339,2422,997,0001,132,0002,117,632stderr