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 13:31Yuriy LyfenkoYuriy LyfenkoScore: 1,573,659Success
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 13:311,572,5814,006,133,7153,931,452,25802,256,896
2Jul 10, 2023 13:311,573,6593,985,462,5383,934,147,43002,289,664
3Jul 10, 2023 13:311,574,0403,974,459,4443,935,099,01902,297,856