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:43A_ShamanA_ShamanScore: 13,402Success
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:4312,86641,649,17326,960,0005,207,0002,113,536
2Jul 2, 2026 09:4312,98142,365,27727,195,0005,259,0002,113,536
3Jul 2, 2026 09:4313,05241,994,39327,649,0004,981,0002,113,536
4Jul 2, 2026 09:4313,07342,053,76227,729,0004,955,0002,113,536
5Jul 2, 2026 09:4313,40242,923,87428,492,0005,013,0002,113,536
6Jul 2, 2026 09:4313,48043,144,33028,711,0004,990,0002,113,536
7Jul 2, 2026 09:4313,55443,381,14828,497,0005,389,0002,113,536
8Jul 2, 2026 09:4313,77543,895,04629,244,0005,194,0002,113,536
9Jul 2, 2026 09:4313,88644,212,57629,486,0005,229,0002,113,536