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 08:26marko1597marko1597Score: 1,554Success
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 08:531,52912,254,4172,753,0001,070,0002,113,536
2Aug 16, 2026 08:531,54712,226,6252,799,0001,069,0002,113,536
3Aug 16, 2026 08:531,54812,206,8822,794,0001,076,0002,113,536
4Aug 16, 2026 08:531,54812,229,8542,799,0001,071,0002,113,536
5Aug 16, 2026 08:531,55412,166,2672,801,0001,084,0002,113,536
6Aug 16, 2026 08:531,66412,490,8453,060,0001,101,0002,113,536
7Aug 16, 2026 08:531,66812,526,5952,931,0001,239,0002,113,536
8Aug 16, 2026 08:531,72512,642,7423,189,0001,125,0002,113,536
9Aug 16, 2026 08:531,80229,721,9903,292,0001,215,0002,113,536