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:26NoSIMD_C#NoSIMD_C#Score: 1,137,456Success
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:261,137,2702,866,681,1022,841,177,0001,998,0002,506,752
2Apr 3, 2025 10:261,137,4562,868,203,5012,842,640,000999,0002,281,472
3Apr 3, 2025 10:261,138,8162,873,684,2012,845,043,0001,998,0002,506,752