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 21, 2023 22:09Mikhail ShirokovMikhail ShirokovScore: 1,574,050Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2023 22:091,573,9274,002,139,8013,934,817,67102,187,264
2Jul 21, 2023 22:091,574,0503,989,747,0383,935,126,04102,179,072
3Jul 21, 2023 22:091,576,7524,015,671,1833,941,879,02002,252,800