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 1, 2026 04:46Victor MerckléVictor MerckléScore: 1,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 04:471,70512,815,0453,180,0001,083,0002,117,632stderr
2Aug 1, 2026 04:471,78012,895,8303,335,0001,116,0002,117,632stderr
3Aug 1, 2026 04:471,80013,152,2533,246,0001,255,0002,117,632stderr
4Aug 1, 2026 04:471,80512,990,3913,394,0001,119,0002,117,632stderr
5Aug 1, 2026 04:471,80613,004,5683,384,0001,131,0002,117,632stderr
6Aug 1, 2026 04:471,82113,792,2263,420,0001,134,0002,117,632stderr
7Aug 1, 2026 04:471,82713,780,4173,437,0001,131,0002,117,632stderr
8Aug 1, 2026 04:471,82913,001,2833,432,0001,142,0002,117,632stderr
9Aug 1, 2026 04:471,85913,789,2163,492,0001,156,0002,117,632stderr