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 16, 2026 07:11marko1597marko1597Score: 1,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 07:241,58612,401,9112,793,0001,172,0002,113,536
2Aug 16, 2026 07:241,60813,545,4382,849,0001,172,0002,113,536
3Aug 16, 2026 07:241,61212,402,6132,840,0001,190,0002,113,536
4Aug 16, 2026 07:241,64412,574,2652,998,0001,112,0002,113,536
5Aug 16, 2026 07:241,71012,708,9583,052,0001,225,0002,113,536
6Aug 16, 2026 07:241,73812,744,6623,122,0001,225,0002,113,536
7Aug 16, 2026 07:241,74512,793,6753,125,0001,239,0002,113,536
8Aug 16, 2026 07:241,74612,765,9373,145,0001,221,0002,113,536
9Aug 16, 2026 07:241,74812,773,2663,130,0001,241,0002,113,536