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 listDec 23, 2025 05:00Josu San MartinJosu San MartinScore: 27,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 05:0027,62596,701,58659,053,00010,009,0002,428,928
2Dec 23, 2025 05:0027,69495,598,00365,222,0004,013,0002,494,464
3Dec 23, 2025 05:0027,72892,430,70564,296,0005,023,0002,420,736
4Dec 23, 2025 05:0027,85494,050,52659,544,00010,092,0002,301,952
5Dec 23, 2025 05:0027,86597,464,96461,586,0008,076,0002,301,952
6Dec 23, 2025 05:0027,88696,446,54762,745,0006,971,0002,297,856
7Dec 23, 2025 05:0027,92798,527,12962,836,0006,981,0002,301,952
8Dec 23, 2025 05:0027,94392,676,03060,877,0008,981,0002,400,256
9Dec 23, 2025 05:0028,030100,091,80764,068,0006,006,0002,301,952