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 15, 2026 23:34marko1597marko1597Score: 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 15, 2026 23:521,58612,329,2692,772,0001,193,0002,113,536
2Aug 15, 2026 23:521,64512,578,4072,983,0001,131,0002,113,536
3Aug 15, 2026 23:521,68612,648,7153,014,0001,203,0002,113,536
4Aug 15, 2026 23:521,69312,640,0033,026,0001,207,0002,113,536
5Aug 15, 2026 23:521,70012,582,0183,013,0001,239,0002,113,536
6Aug 15, 2026 23:521,71712,559,4803,073,0001,221,0002,113,536
7Aug 15, 2026 23:521,72012,605,9363,080,0001,220,0002,113,536
8Aug 15, 2026 23:521,79312,850,7803,263,0001,221,0002,113,536
9Aug 15, 2026 23:521,84621,774,9713,506,0001,111,0002,113,536