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 listFeb 10, 2025 07:03NoSIMD_C#NoSIMD_C#Score: 1,137,936Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2025 07:031,137,2742,871,948,4462,841,188,0001,998,0002,273,280
2Feb 10, 2025 07:031,137,9362,871,472,4282,843,840,000999,0002,281,472
3Feb 10, 2025 07:031,139,2972,875,159,3412,846,245,0001,998,0002,273,280