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 listMay 30, 2026 03:23Victor MerckléVictor MerckléScore: 2,602Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 03:252,53117,126,4434,996,0001,333,0002,113,536
2May 30, 2026 03:252,54116,326,5425,015,0001,338,0002,113,536
3May 30, 2026 03:252,55415,374,2535,037,0001,350,0002,113,536
4May 30, 2026 03:252,59914,297,4705,168,0001,331,0002,113,536
5May 30, 2026 03:252,60214,149,1605,172,0001,333,0002,113,536
6May 30, 2026 03:252,61014,305,1455,196,0001,330,0002,113,536
7May 30, 2026 03:252,61916,094,0965,218,0001,330,0002,113,536
8May 30, 2026 03:252,62014,871,1955,219,0001,332,0002,113,536
9May 30, 2026 03:252,69815,119,2614,464,0002,281,0002,113,536