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 listJul 2, 2026 09:46A_ShamanA_ShamanScore: 15,246Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 09:4614,99747,048,65431,510,0005,983,0002,113,536
2Jul 2, 2026 09:4615,03947,161,14431,596,0006,002,0002,113,536
3Jul 2, 2026 09:4615,10147,591,20631,630,0006,124,0002,113,536
4Jul 2, 2026 09:4615,21647,444,70832,028,0006,014,0002,113,536
5Jul 2, 2026 09:4615,24647,631,52532,066,0006,049,0002,113,536
6Jul 2, 2026 09:4615,25847,655,19331,988,0006,159,0002,113,536
7Jul 2, 2026 09:4615,27847,714,51431,932,0006,264,0002,113,536
8Jul 2, 2026 09:4615,29247,642,99732,420,0005,812,0002,113,536
9Jul 2, 2026 09:4615,64248,637,77632,706,0006,401,0002,113,536