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 18, 2026 07:35Victor MerckléVictor MerckléScore: 2,519Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 07:362,49414,633,2483,540,0002,695,0002,146,304stderr
2Aug 18, 2026 07:362,49514,652,2323,544,0002,695,0002,146,304stderr
3Aug 18, 2026 07:362,49614,663,3163,581,0002,661,0002,146,304stderr
4Aug 18, 2026 07:362,50214,656,1203,658,0002,599,0002,146,304stderr
5Aug 18, 2026 07:362,51914,700,0313,870,0002,428,0002,146,304stderr
6Aug 18, 2026 07:362,56114,827,7593,962,0002,442,0002,146,304stderr
7Aug 18, 2026 07:362,59714,911,2563,912,0002,581,0002,146,304stderr
8Aug 18, 2026 07:362,62214,918,4983,971,0002,585,0002,146,304stderr
9Aug 18, 2026 07:362,66515,067,7044,037,0002,626,0002,142,208stderr