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:19E SequeiraE SequeiraScore: 879,986Success
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:19879,9562,222,923,8612,197,893,0001,998,0002,461,696
2Nov 23, 2024 18:19879,9862,231,579,4602,198,965,000999,0002,322,432
3Nov 23, 2024 18:19880,3842,227,043,6372,199,961,000999,0002,359,296