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 listMar 20, 2026 12:24Dominique GarmierDominique GarmierScore: 8,780Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 12:088,69452,806,98717,596,0004,140,0002,306,048
2Mar 20, 2026 11:508,75346,334,92315,915,0005,968,0002,396,160
3Mar 20, 2026 11:508,75854,236,16119,906,0001,990,0002,502,656
4Mar 20, 2026 12:088,76044,969,17018,913,0002,986,0002,277,376
5Mar 20, 2026 12:588,76049,557,05017,919,0003,982,0002,277,376
6Mar 20, 2026 12:248,76544,756,44315,937,0005,976,0002,297,856
7Mar 20, 2026 13:388,76649,834,82917,931,0003,984,0002,355,200
8Mar 20, 2026 13:388,78044,937,39816,962,0004,988,0002,277,376
9Mar 20, 2026 12:588,78145,412,43016,964,0004,989,0002,375,680
10Mar 20, 2026 13:388,81850,907,01018,036,0004,008,0002,293,760
11Mar 20, 2026 12:248,81951,271,01518,039,0004,008,0002,297,856
12Mar 20, 2026 12:588,91448,416,06416,208,0006,078,0002,277,376
13Mar 20, 2026 12:089,01945,602,38919,474,0003,074,0002,478,080
14Mar 20, 2026 11:509,02752,177,29119,491,0003,077,0002,453,504
15Mar 20, 2026 12:249,04848,182,39819,537,0003,084,0002,482,176