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 08:57Victor MerckléVictor MerckléScore: 1,690Success
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:001,67512,423,1743,082,0001,106,0002,117,632stderr
2Aug 29, 2026 09:001,67612,643,8903,073,0001,117,0002,117,632stderr
3Aug 29, 2026 09:001,68412,392,1102,913,0001,299,0002,117,632stderr
4Aug 29, 2026 09:001,68912,431,0553,104,0001,120,0002,117,632stderr
5Aug 29, 2026 09:001,69012,422,9382,901,0001,325,0002,117,632stderr
6Aug 29, 2026 09:001,77313,354,1613,094,0001,340,0002,117,632stderr
7Aug 29, 2026 09:001,78012,820,3333,129,0001,321,0002,117,632stderr
8Aug 29, 2026 09:001,78312,694,0013,292,0001,166,0002,117,632stderr
9Aug 29, 2026 09:001,87422,165,1993,555,0001,132,0002,117,632stderr