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 20, 2026 14:44Victor MerckléVictor MerckléScore: 2,730Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 14:452,71214,494,9315,435,0001,347,0002,113,536
2May 20, 2026 14:452,71315,949,3395,439,0001,344,0002,113,536
3May 20, 2026 14:452,72214,598,7035,456,0001,351,0002,113,536
4May 20, 2026 14:452,73016,249,2695,471,0001,354,0002,113,536
5May 20, 2026 14:452,73017,097,9375,478,0001,348,0002,113,536
6May 20, 2026 14:452,73815,240,3765,483,0001,362,0002,113,536
7May 20, 2026 14:452,81616,724,7265,701,0001,341,0002,113,536
8May 20, 2026 14:452,82814,851,5325,724,0001,346,0002,113,536
9May 20, 2026 14:452,84214,887,2435,759,0001,346,0002,113,536