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 listJun 30, 2026 21:44Victor MerckléVictor MerckléScore: 1,656Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 21:461,64811,997,6932,936,0001,185,0002,117,632stderr
2Jun 30, 2026 21:461,65012,009,8942,935,0001,190,0002,117,632stderr
3Jun 30, 2026 21:461,65112,045,9482,933,0001,196,0002,117,632stderr
4Jun 30, 2026 21:461,65312,097,4102,941,0001,192,0002,117,632stderr
5Jun 30, 2026 21:461,65612,073,1952,937,0001,204,0002,117,632stderr
6Jun 30, 2026 21:461,65812,059,6642,947,0001,198,0002,117,632stderr
7Jun 30, 2026 21:461,66612,100,4592,955,0001,211,0002,117,632stderr
8Jun 30, 2026 21:461,69712,156,8562,934,0001,310,0002,117,632stderr
9Jun 30, 2026 21:461,75612,726,8893,138,0001,253,0002,117,632stderr