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 30, 2026 23:13Victor MerckléVictor MerckléScore: 1,480Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 23:251,46011,923,1862,590,0001,061,0002,117,632stderr
2Aug 30, 2026 23:251,47012,106,5812,607,0001,069,0002,117,632stderr
3Aug 30, 2026 23:251,47112,221,1352,595,0001,083,0002,117,632stderr
4Aug 30, 2026 23:251,47612,117,0882,605,0001,085,0002,117,632stderr
5Aug 30, 2026 23:251,48012,210,0432,621,0001,081,0002,117,632stderr
6Aug 30, 2026 23:251,50612,009,0012,680,0001,085,0002,117,632stderr
7Aug 30, 2026 23:251,54412,176,3932,746,0001,115,0002,117,632stderr
8Aug 30, 2026 23:251,54912,069,3662,743,0001,130,0002,117,632stderr
9Aug 30, 2026 23:251,56512,120,2402,782,0001,131,0002,117,632stderr