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 09:42Victor MerckléVictor MerckléScore: 1,601Success
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 09:441,59212,360,8042,843,0001,138,0002,117,632stderr
2Aug 29, 2026 09:441,59612,366,7352,859,0001,133,0002,117,632stderr
3Aug 29, 2026 09:441,59612,304,6492,857,0001,133,0002,117,632stderr
4Aug 29, 2026 09:441,60112,325,1242,863,0001,140,0002,117,632stderr
5Aug 29, 2026 09:441,60112,297,4032,847,0001,156,0002,117,632stderr
6Aug 29, 2026 09:441,62412,352,7452,896,0001,164,0002,117,632stderr
7Aug 29, 2026 09:441,67012,540,3772,984,0001,191,0002,117,632stderr
8Aug 29, 2026 09:441,69612,568,6853,053,0001,187,0002,117,632stderr
9Aug 29, 2026 09:441,71212,634,4093,089,0001,192,0002,117,632stderr