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 listApr 3, 2025 10:25NoSIMD_C#NoSIMD_C#Score: 1,262,207Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2025 10:251,260,8613,182,764,2953,151,153,000999,0002,289,664
2Apr 3, 2025 10:251,262,2073,187,477,5103,149,523,0005,995,0002,289,664
3Apr 3, 2025 10:251,262,8323,187,703,1203,156,081,000999,0002,289,664