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 8, 2025 07:21NoSIMD_C#NoSIMD_C#Score: 1,003,521Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 8, 2025 07:211,002,3662,529,504,5462,504,915,000999,0002,461,696
2Apr 8, 2025 07:211,003,5212,536,394,5742,506,804,0001,998,0002,273,280
3Apr 8, 2025 07:211,005,6382,545,181,0342,512,096,0001,998,0002,273,280