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:30Tomislav TunkovicTomislav TunkovicScore: 2,047Success
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:311,93216,024,1723,568,0001,263,000552,960
2Aug 30, 2026 16:311,94616,860,8963,571,0001,294,000552,960
3Aug 30, 2026 16:311,95613,150,3993,660,0001,230,000552,960
4Aug 30, 2026 16:312,03615,473,2663,800,0001,292,000552,960
5Aug 30, 2026 16:312,04717,026,4493,831,0001,288,000552,960
6Aug 30, 2026 16:312,05915,945,4163,906,0001,242,000552,960
7Aug 30, 2026 16:312,06816,418,8393,886,0001,284,000552,960
8Aug 30, 2026 16:312,07315,464,2383,895,0001,289,000552,960
9Aug 30, 2026 16:312,08316,467,3073,979,0001,230,000552,960