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 09:23limanjun99limanjun99Score: 3,165Success
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 09:233,01123,637,0995,377,0002,150,0002,265,088
2Apr 13, 2026 09:233,02125,721,0355,395,0002,158,0002,273,280
3Apr 13, 2026 09:233,07630,482,4875,493,0002,197,0002,293,760
4Apr 13, 2026 09:233,16525,280,6945,934,0001,978,0002,269,184
5Apr 13, 2026 09:233,16524,739,3665,935,0001,978,0002,527,232
6Apr 13, 2026 09:233,16629,160,8375,937,0001,979,0002,293,760
7Apr 13, 2026 09:233,16728,643,8524,949,0002,969,0002,293,760
8Apr 13, 2026 09:233,16928,401,7005,942,0001,980,0002,293,760
9Apr 13, 2026 09:233,19224,846,3414,988,0002,993,0002,285,568