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 12:29Victor MerckléVictor MerckléScore: 1,626Success
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 12:331,57812,437,4332,852,0001,095,0002,117,632stderr
2Aug 29, 2026 12:331,58312,265,8252,878,0001,081,0002,117,632stderr
3Aug 29, 2026 12:331,59113,565,8772,880,0001,098,0002,117,632stderr
4Aug 29, 2026 12:331,59812,344,1242,892,0001,105,0002,117,632stderr
5Aug 29, 2026 12:331,62612,465,7692,928,0001,139,0002,117,632stderr
6Aug 29, 2026 12:331,65012,586,3032,872,0001,255,0002,117,632stderr
7Aug 29, 2026 12:331,69113,815,0043,099,0001,129,0002,117,632stderr
8Aug 29, 2026 12:331,69612,718,7803,100,0001,141,0002,117,632stderr
9Aug 29, 2026 12:331,70412,641,0283,116,0001,144,0002,117,632stderr