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 9, 2025 17:47NoSIMD_C#NoSIMD_C#Score: 82,117Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2025 17:4782,110233,270,226202,271,0003,004,0002,293,760
2Apr 9, 2025 17:4782,117231,921,566204,292,0001,001,0002,297,856
3Apr 9, 2025 17:4782,317228,569,336203,795,0001,997,0002,506,752