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 listNov 23, 2024 18:18E SequeiraE SequeiraScore: 311,400Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 18:18311,316803,701,574778,291,00002,424,832
2Nov 23, 2024 18:18311,400803,295,984777,501,000999,0002,277,376
3Nov 23, 2024 18:18311,559798,833,125778,897,00002,420,736