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 1, 2026 04:52Victor MerckléVictor MerckléScore: 1,676Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 04:541,59112,406,1762,891,0001,088,0002,117,632stderr
2Aug 1, 2026 04:541,63612,596,3212,952,0001,139,0002,117,632stderr
3Aug 1, 2026 04:541,66113,456,4633,049,0001,104,0002,117,632stderr
4Aug 1, 2026 04:541,67212,788,3193,053,0001,127,0002,117,632stderr
5Aug 1, 2026 04:541,67612,678,0593,033,0001,157,0002,117,632stderr
6Aug 1, 2026 04:541,68912,692,4003,090,0001,134,0002,117,632stderr
7Aug 1, 2026 04:541,69913,496,2883,103,0001,145,0002,117,632stderr
8Aug 1, 2026 04:541,70213,476,3823,122,0001,134,0002,117,632stderr
9Aug 1, 2026 04:541,72614,877,6163,169,0001,146,0002,117,632stderr