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 21:13Victor MerckléVictor MerckléScore: 2,582Success
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 21:142,53614,127,0965,014,0001,327,0002,113,536
2May 29, 2026 21:142,54015,810,2095,023,0001,329,0002,113,536
3May 29, 2026 21:142,55014,146,6035,047,0001,329,0002,113,536
4May 29, 2026 21:142,57616,408,9755,082,0001,360,0002,113,536
5May 29, 2026 21:142,58214,942,1715,110,0001,346,0002,113,536
6May 29, 2026 21:142,61015,960,6895,160,0001,366,0002,113,536
7May 29, 2026 21:142,63016,758,3855,253,0001,324,0002,113,536
8May 29, 2026 21:142,63815,061,8865,271,0001,326,0002,113,536
9May 29, 2026 21:142,64014,309,7775,271,0001,329,0002,113,536