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 listMay 30, 2026 11:44Victor MerckléVictor MerckléScore: 2,604Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 11:452,52416,033,7474,978,0001,333,0002,113,536
2May 30, 2026 11:452,52613,948,9944,984,0001,332,0002,113,536
3May 30, 2026 11:452,54014,047,5885,013,0001,337,0002,113,536
4May 30, 2026 11:452,54313,965,0465,020,0001,339,0002,113,536
5May 30, 2026 11:452,60416,517,9204,230,0002,281,0002,113,536
6May 30, 2026 11:452,61314,688,4315,206,0001,327,0002,113,536
7May 30, 2026 11:452,62016,087,8644,282,0002,270,0002,113,536
8May 30, 2026 11:452,63215,746,6395,248,0001,332,0002,113,536
9May 30, 2026 11:452,68714,533,1584,427,0002,292,0002,113,536