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 17:14Victor 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 17:181,46011,821,2192,139,0001,513,0002,117,632stderr
2Aug 29, 2026 17:181,46211,820,6522,561,0001,094,0002,117,632stderr
3Aug 29, 2026 17:181,47712,000,9042,127,0001,566,0002,117,632stderr
4Aug 29, 2026 17:181,53412,002,4652,240,0001,595,0002,117,632stderr
5Aug 29, 2026 17:181,54812,331,5802,775,0001,096,0002,117,632stderr
6Aug 29, 2026 17:181,55312,218,8572,772,0001,112,0002,117,632stderr
7Aug 29, 2026 17:181,57412,165,1102,687,0001,249,0002,117,632stderr
8Aug 29, 2026 17:181,61718,572,9102,891,0001,152,0002,117,632stderr
9Aug 29, 2026 17:181,63519,901,7662,952,0001,137,0002,117,632stderr