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 listJul 28, 2024 13:36kenkenScore: 1,651,795Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2024 13:361,651,7204,167,574,3254,129,299,22202,183,168
2Jul 28, 2024 13:361,651,7954,175,912,1994,129,488,27102,310,144
3Jul 28, 2024 13:361,652,6784,189,179,7284,131,695,37602,191,360