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 listSep 15, 2026 10:09Victor MerckléVictor MerckléScore: 1,391Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 10:091,34612,406,0851,838,0001,529,0002,117,632stderr
2Sep 15, 2026 10:091,35612,383,0542,296,0001,096,0002,117,632stderr
3Sep 15, 2026 10:091,38712,459,0461,890,0001,579,0002,117,632stderr
4Sep 15, 2026 10:091,39012,454,5311,909,0001,566,0002,117,632stderr
5Sep 15, 2026 10:091,39112,514,4401,913,0001,565,0002,117,632stderr
6Sep 15, 2026 10:091,39412,346,0841,900,0001,586,0002,117,632stderr
7Sep 15, 2026 10:091,39612,416,9341,911,0001,579,0002,117,632stderr
8Sep 15, 2026 10:091,43212,628,1951,975,0001,607,0002,117,632stderr
9Sep 15, 2026 10:091,48313,361,0442,574,0001,135,0002,117,632stderr