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 listDec 23, 2025 04:43Josu San MartinJosu San MartinScore: 255,203Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 04:43254,713663,847,123628,785,0007,997,0002,383,872
2Dec 23, 2025 04:43254,871667,203,971631,177,0006,001,0002,510,848
3Dec 23, 2025 04:43254,923666,110,253630,305,0007,003,0002,519,040
4Dec 23, 2025 04:43255,087667,728,250631,720,0005,997,0002,359,296
5Dec 23, 2025 04:43255,203662,981,455630,008,0008,000,0002,510,848
6Dec 23, 2025 04:43255,472666,804,792630,685,0007,996,0002,314,240
7Dec 23, 2025 04:43255,579667,969,234630,948,0007,999,0002,457,600
8Dec 23, 2025 04:43256,430674,367,175634,076,0007,000,0002,314,240
9Dec 23, 2025 04:43256,434672,306,316633,085,0008,001,0002,506,752