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 22, 2026 17:18Dominique GarmierDominique GarmierScore: 57,638Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 20:0757,580171,077,559134,954,0008,996,0002,330,624
2Mar 22, 2026 20:0757,592172,084,428129,982,00013,998,0002,441,216
3Mar 22, 2026 20:0757,628176,126,451134,065,00010,004,0002,306,048
4Mar 22, 2026 19:5757,630173,068,503137,073,0007,003,0002,535,424
5Mar 22, 2026 17:1857,638168,169,077138,091,0006,003,0002,445,312
6Mar 22, 2026 19:5757,742169,201,726131,232,00013,123,0002,318,336
7Mar 22, 2026 19:5758,084170,068,689135,196,00010,014,0002,535,424
8Mar 22, 2026 17:1858,528171,065,823140,308,0006,013,0002,449,408
9Mar 22, 2026 17:1859,204174,405,122141,009,0007,000,0002,478,080