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:18NoSIMD_C#NoSIMD_C#Score: 82,310Success
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:1882,196234,934,273202,483,0003,007,0002,539,520
2Apr 4, 2025 08:1882,214230,722,867203,530,0002,005,0002,351,104
3Apr 4, 2025 08:1882,218229,057,823204,543,0001,002,0002,318,336
4Apr 4, 2025 08:1882,259237,372,307203,651,0001,996,0002,371,584
5Apr 4, 2025 08:1882,310231,587,111203,779,0001,997,0002,519,040
6Apr 4, 2025 08:1882,314234,307,296202,790,0002,996,0002,359,296
7Apr 4, 2025 08:1882,317230,541,253201,797,0003,995,0002,297,856
8Apr 4, 2025 08:1882,395227,187,985202,988,0002,999,0002,293,760
9Apr 4, 2025 08:1882,402231,693,432204,006,0002,000,0002,293,760