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 4, 2025 08:12NoSIMD_C#NoSIMD_C#Score: 83,914Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 4, 2025 08:1283,671233,399,186206,175,0003,002,0002,297,856
2Apr 4, 2025 08:1283,686245,561,319206,213,0003,003,0002,293,760
3Apr 4, 2025 08:1283,744238,232,234206,354,0003,005,0002,383,872
4Apr 4, 2025 08:1283,794237,490,087207,481,0002,004,0002,293,760
5Apr 4, 2025 08:1283,914235,276,354207,788,0001,997,0002,359,296
6Apr 4, 2025 08:1283,948235,649,660204,874,0004,996,0002,363,392
7Apr 4, 2025 08:1283,964233,501,397204,913,0004,997,0002,297,856
8Apr 4, 2025 08:1283,980238,365,366204,953,0004,998,0002,514,944
9Apr 4, 2025 08:1284,028234,695,400207,070,0003,001,0002,375,680