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 listJan 18, 2025 04:01Ian MckibbenIan MckibbenScore: 1,005,413Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2025 04:011,002,0922,536,391,3622,503,233,0001,998,0002,273,280
2Jan 18, 2025 04:011,002,9592,537,566,8642,507,398,00002,273,280
3Jan 18, 2025 04:011,004,0042,539,835,0002,508,013,0001,998,0002,273,280
4Jan 18, 2025 04:011,004,2922,535,277,5932,510,730,00002,273,280
5Jan 18, 2025 04:011,005,4132,541,587,9452,512,533,000999,0002,273,280
6Jan 18, 2025 04:011,005,8542,539,000,2172,513,636,000999,0002,465,792
7Jan 18, 2025 04:011,005,9172,540,105,3282,513,794,000999,0002,453,504
8Jan 18, 2025 04:011,007,5142,543,054,0042,517,785,000999,0002,281,472
9Jan 18, 2025 04:011,008,7412,546,914,3962,521,853,00002,273,280