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 listJul 5, 2026 17:10Victor MerckléVictor MerckléScore: 1,676Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 17:121,64512,489,8422,964,0001,150,0002,117,632stderr
2Jul 5, 2026 17:121,65012,094,4502,966,0001,160,0002,117,632stderr
3Jul 5, 2026 17:121,65212,129,5582,966,0001,164,0002,117,632stderr
4Jul 5, 2026 17:121,66212,186,5262,980,0001,175,0002,117,632stderr
5Jul 5, 2026 17:121,67612,189,5943,013,0001,178,0002,117,632stderr
6Jul 5, 2026 17:121,74112,904,0543,145,0001,208,0002,117,632stderr
7Jul 5, 2026 17:121,75012,410,9343,175,0001,200,0002,117,632stderr
8Jul 5, 2026 17:121,76012,935,1333,188,0001,213,0002,117,632stderr
9Jul 5, 2026 17:121,77012,460,5683,211,0001,216,0002,117,632stderr