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 10, 2023 01:30Robert BurkeRobert BurkeScore: 1,651,906Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2023 01:301,651,6134,190,898,5714,129,031,27002,252,800
2Jul 10, 2023 01:301,651,9064,175,028,9344,129,764,48002,179,072
3Jul 10, 2023 01:301,652,1704,183,168,4264,130,425,96102,179,072