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:14Victor 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 30, 2026 08:152,51614,544,5424,956,0001,336,0002,113,536
2May 30, 2026 08:152,52414,558,2174,975,0001,337,0002,113,536
3May 30, 2026 08:152,53314,175,5284,994,0001,339,0002,113,536
4May 30, 2026 08:152,53815,128,0005,007,0001,340,0002,113,536
5May 30, 2026 08:152,58217,517,0235,085,0001,372,0002,113,536
6May 30, 2026 08:152,61115,417,1745,197,0001,331,0002,113,536
7May 30, 2026 08:152,62616,104,8295,233,0001,334,0002,113,536
8May 30, 2026 08:152,67216,967,8744,405,0002,275,0002,113,536
9May 30, 2026 08:152,67214,422,5844,399,0002,282,0002,113,536