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:33marko1597marko1597Score: 1,700Success
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:541,61012,402,5492,841,0001,185,0002,113,536
2Aug 16, 2026 07:541,61412,383,2392,853,0001,182,0002,113,536
3Aug 16, 2026 07:541,61812,711,9882,854,0001,192,0002,113,536
4Aug 16, 2026 07:541,62821,428,0092,850,0001,222,0002,113,536
5Aug 16, 2026 07:541,70012,692,6213,045,0001,205,0002,113,536
6Aug 16, 2026 07:541,72912,627,4033,109,0001,214,0002,113,536
7Aug 16, 2026 07:541,73612,679,6933,117,0001,223,0002,113,536
8Aug 16, 2026 07:541,74913,425,9733,152,0001,222,0002,113,536
9Aug 16, 2026 07:541,77123,012,2113,302,0001,126,0002,113,536