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 listApr 13, 2026 15:26limanjun99limanjun99Score: 2,999Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 15:262,97726,726,6445,316,0002,126,0002,293,760
2Apr 13, 2026 15:262,97827,323,2115,318,0002,127,0002,293,760
3Apr 13, 2026 15:262,99333,075,0695,345,0002,138,0002,293,760
4Apr 13, 2026 15:262,99623,510,6555,351,0002,140,0002,293,760
5Apr 13, 2026 15:262,99924,920,5585,356,0002,142,0002,527,232
6Apr 13, 2026 15:263,02828,121,3685,407,0002,163,0002,293,760
7Apr 13, 2026 15:263,11129,036,4475,556,0002,222,0002,293,760
8Apr 13, 2026 15:263,11823,542,2546,683,0001,113,0002,293,760
9Apr 13, 2026 15:263,16924,438,1825,942,0001,980,0002,527,232