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 listAug 30, 2026 16:32Tomislav TunkovicTomislav TunkovicScore: 2,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 16:352,22316,577,9824,178,0001,380,000548,864
2Aug 30, 2026 16:352,23715,267,3424,348,0001,245,000544,768
3Aug 30, 2026 16:352,24415,207,0444,358,0001,252,000548,864
4Aug 30, 2026 16:352,24415,277,3684,363,0001,249,000548,864
5Aug 30, 2026 16:352,25015,320,6654,368,0001,259,000548,864
6Aug 30, 2026 16:352,25015,226,2564,363,0001,262,000544,768
7Aug 30, 2026 16:352,25215,266,0844,377,0001,253,000544,768
8Aug 30, 2026 16:352,25715,224,9204,385,0001,259,000548,864
9Aug 30, 2026 16:352,26215,347,9954,394,0001,263,000548,864