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 29, 2026 22:43Victor MerckléVictor MerckléScore: 2,681Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 22:452,66714,464,1345,463,0001,206,0002,113,536
2May 29, 2026 22:452,66717,117,9275,462,0001,206,0002,113,536
3May 29, 2026 22:452,67314,336,7275,477,0001,206,0002,113,536
4May 29, 2026 22:452,67415,260,8615,479,0001,207,0002,113,536
5May 29, 2026 22:452,68117,019,9925,493,0001,210,0002,113,536
6May 29, 2026 22:452,70214,686,0905,532,0001,225,0002,113,536
7May 29, 2026 22:452,73515,150,1475,603,0001,235,0002,113,536
8May 29, 2026 22:452,73615,309,3325,604,0001,237,0002,113,536
9May 29, 2026 22:452,74115,563,1865,548,0001,306,0002,113,536