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:34Victor MerckléVictor MerckléScore: 2,757Success
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:352,73515,241,0905,495,0001,343,0002,113,536
2May 20, 2026 14:352,73816,225,7675,502,0001,344,0002,113,536
3May 20, 2026 14:352,74217,555,5815,511,0001,345,0002,113,536
4May 20, 2026 14:352,75216,307,0675,535,0001,345,0002,113,536
5May 20, 2026 14:352,75715,436,9875,545,0001,349,0002,113,536
6May 20, 2026 14:352,77715,304,1845,582,0001,362,0002,113,536
7May 20, 2026 14:352,82116,866,9545,714,0001,340,0002,113,536
8May 20, 2026 14:352,87417,442,4335,850,0001,337,0002,113,536
9May 20, 2026 14:352,88517,983,0585,871,0001,342,0002,113,536