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 3, 2025 05:46NoSIMD_C#NoSIMD_C#Score: 1,300,054Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2025 05:461,298,0343,272,684,5403,244,086,000999,0002,502,656
2Feb 3, 2025 05:461,300,0543,273,493,1673,249,137,000999,0002,273,280
3Feb 3, 2025 05:461,300,5603,275,557,2483,250,402,000999,0002,433,024