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 listJan 29, 2025 11:11NoSIMD_C#NoSIMD_C#Score: 1,265,810Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2025 11:111,263,1103,184,700,8743,156,776,000999,0002,293,760
2Jan 29, 2025 11:111,265,8103,195,507,1133,164,526,00002,285,568
3Jan 29, 2025 11:111,267,3703,194,254,3513,167,427,000999,0002,293,760