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 listApr 12, 2026 04:26limanjun99limanjun99Score: 754,136Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 04:26754,0131,906,660,1741,884,034,000999,0002,289,664
2Apr 12, 2026 04:26754,0261,912,752,4781,884,065,000999,0002,293,760
3Apr 12, 2026 04:26754,0551,910,640,7041,884,138,000999,0002,277,376
4Apr 12, 2026 04:26754,0981,914,768,9811,884,247,000999,0002,293,760
5Apr 12, 2026 04:26754,1361,910,642,1231,884,342,000999,0002,273,280
6Apr 12, 2026 04:26754,1411,910,061,8711,885,353,00002,289,664
7Apr 12, 2026 04:26754,7061,919,085,4561,883,766,0002,998,0002,281,472
8Apr 12, 2026 04:26754,7081,914,823,5971,885,772,000999,0002,289,664
9Apr 12, 2026 04:26754,7501,912,852,6361,884,877,0001,998,0002,289,664