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 08:43Victor MerckléVictor MerckléScore: 2,598Success
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 08:452,53514,984,6405,009,0001,329,0002,113,536
2May 30, 2026 08:452,53816,219,6235,019,0001,327,0002,113,536
3May 30, 2026 08:452,54114,492,2265,019,0001,334,0002,113,536
4May 30, 2026 08:452,56815,871,2445,071,0001,350,0002,113,536
5May 30, 2026 08:452,59816,623,0865,166,0001,331,0002,113,536
6May 30, 2026 08:452,62217,151,6385,227,0001,330,0002,113,536
7May 30, 2026 08:452,63215,061,0194,314,0002,267,0002,113,536
8May 30, 2026 08:452,63416,392,6905,256,0001,329,0002,113,536
9May 30, 2026 08:452,65616,308,8895,297,0001,345,0002,113,536