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 listJul 8, 2026 01:49Victor MerckléVictor MerckléScore: 1,606Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 01:511,57711,956,8602,871,0001,072,0002,117,632stderr
2Jul 8, 2026 01:511,59512,001,4342,894,0001,095,0002,117,632stderr
3Jul 8, 2026 01:511,59611,892,8812,890,0001,100,0002,117,632stderr
4Jul 8, 2026 01:511,59912,212,1762,893,0001,105,0002,117,632stderr
5Jul 8, 2026 01:511,60612,014,9622,897,0001,120,0002,117,632stderr
6Jul 8, 2026 01:511,62212,147,9592,873,0001,184,0002,117,632stderr
7Jul 8, 2026 01:511,68812,304,8973,097,0001,123,0002,117,632stderr
8Jul 8, 2026 01:511,69612,297,2123,106,0001,134,0002,117,632stderr
9Jul 8, 2026 01:511,70112,845,0513,102,0001,151,0002,117,632stderr