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 12:15Victor MerckléVictor MerckléScore: 2,621Success
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 12:172,52115,773,2344,971,0001,333,0002,113,536
2May 30, 2026 12:172,52715,291,5504,984,0001,335,0002,113,536
3May 30, 2026 12:172,54414,725,2195,024,0001,338,0002,113,536
4May 30, 2026 12:172,59714,245,6045,122,0001,372,0002,113,536
5May 30, 2026 12:172,62114,245,2745,223,0001,331,0002,113,536
6May 30, 2026 12:172,63116,979,2065,241,0001,338,0002,113,536
7May 30, 2026 12:172,64615,707,5825,282,0001,335,0002,113,536
8May 30, 2026 12:172,65216,061,5185,281,0001,350,0002,113,536
9May 30, 2026 12:172,65315,269,8015,283,0001,350,0002,113,536