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 14, 2026 17:51marko1597marko1597Score: 2,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 17:512,51114,587,0185,080,0001,199,0002,117,632
2Aug 14, 2026 17:512,51214,753,6145,106,0001,176,0002,117,632
3Aug 14, 2026 17:512,51314,549,3555,108,0001,175,0002,117,632
4Aug 14, 2026 17:512,51514,841,1975,115,0001,173,0002,117,632
5Aug 14, 2026 17:512,51814,514,0955,104,0001,193,0002,117,632
6Aug 14, 2026 17:512,52314,733,9515,133,0001,176,0002,117,632
7Aug 14, 2026 17:512,52314,535,8335,124,0001,185,0002,117,632
8Aug 14, 2026 17:512,70315,136,5245,524,0001,234,0002,117,632
9Aug 14, 2026 17:512,75015,126,1905,606,0001,269,0002,117,632