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 29, 2026 12:19Victor MerckléVictor MerckléScore: 1,642Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 12:241,57612,330,2862,844,0001,097,0002,117,632stderr
2Aug 29, 2026 12:241,57816,962,7442,836,0001,111,0002,117,632stderr
3Aug 29, 2026 12:241,58912,420,2122,851,0001,123,0002,117,632stderr
4Aug 29, 2026 12:241,64012,429,7912,952,0001,148,0002,117,632stderr
5Aug 29, 2026 12:241,64212,552,3492,951,0001,154,0002,117,632stderr
6Aug 29, 2026 12:241,68912,604,1373,065,0001,159,0002,117,632stderr
7Aug 29, 2026 12:241,69813,328,0363,090,0001,156,0002,117,632stderr
8Aug 29, 2026 12:241,70217,159,5823,090,0001,167,0002,117,632stderr
9Aug 29, 2026 12:241,73913,292,0043,227,0001,122,0002,117,632stderr