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 listMay 17, 2026 15:06Jacob McDanielJacob McDanielScore: 7,288Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 15:137,17629,155,67715,722,0002,220,0002,113,536
2May 17, 2026 15:137,24628,996,39815,927,0002,190,0002,113,536
3May 17, 2026 15:137,28029,311,79015,884,0002,317,0002,113,536
4May 17, 2026 15:137,28027,779,82015,958,0002,243,0002,113,536
5May 17, 2026 15:137,28829,597,23215,951,0002,269,0002,113,536
6May 17, 2026 15:137,31830,797,88216,076,0002,220,0002,113,536
7May 17, 2026 15:137,34429,982,85416,126,0002,234,0002,113,536
8May 17, 2026 15:137,39032,073,33516,206,0002,271,0002,113,536
9May 17, 2026 15:137,41330,215,28116,303,0002,231,0002,113,536