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 listJun 21, 2026 17:35A_ShamanA_ShamanScore: 17,154Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 17:3516,74751,075,87137,377,0004,492,0002,113,536
2Jun 21, 2026 17:3516,86551,295,48137,674,0004,490,0002,113,536
3Jun 21, 2026 17:3516,91651,462,11737,647,0004,643,0002,113,536
4Jun 21, 2026 17:3517,07951,778,38738,177,0004,522,0002,113,536
5Jun 21, 2026 17:3517,15452,088,36838,418,0004,468,0002,113,536
6Jun 21, 2026 17:3517,59353,086,44439,575,0004,409,0002,113,536
7Jun 21, 2026 17:3517,60153,195,59139,446,0004,558,0002,113,536
8Jun 21, 2026 17:3517,64054,701,61339,608,0004,494,0002,113,536
9Jun 21, 2026 17:3517,67453,316,70839,724,0004,462,0002,113,536