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 19:25Victor MerckléVictor MerckléScore: 2,612Success
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 19:272,56515,943,8095,102,0001,312,0002,113,536
2May 29, 2026 19:272,57215,261,5035,118,0001,313,0002,113,536
3May 29, 2026 19:272,58015,237,2905,137,0001,313,0002,113,536
4May 29, 2026 19:272,59914,388,8265,165,0001,334,0002,113,536
5May 29, 2026 19:272,61214,727,9925,219,0001,313,0002,113,536
6May 29, 2026 19:272,63614,262,0075,247,0001,343,0002,113,536
7May 29, 2026 19:272,63914,462,1365,250,0001,349,0002,113,536
8May 29, 2026 19:272,69115,549,4615,418,0001,310,0002,113,536
9May 29, 2026 19:272,73016,461,7045,505,0001,322,0002,113,536