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 listDec 23, 2025 04:58Josu San MartinJosu San MartinScore: 32,004Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 04:5831,919104,773,14172,816,0006,982,0002,334,720
2Dec 23, 2025 04:5731,936112,102,28971,856,0007,984,0002,482,176
3Dec 23, 2025 04:5731,942108,029,70871,869,0007,985,0002,469,888
4Dec 23, 2025 04:5731,943105,453,93770,874,0008,984,0002,469,888
5Dec 23, 2025 04:5831,963105,811,16970,919,0008,989,0002,490,368
6Dec 23, 2025 04:5831,964106,255,54074,915,0004,994,0002,445,312
7Dec 23, 2025 04:5831,970103,539,48671,932,0007,992,0002,482,176
8Dec 23, 2025 04:5731,977104,971,49574,946,0004,996,0002,293,760
9Dec 23, 2025 04:5731,977105,213,79870,950,0008,993,0002,428,928
10Dec 23, 2025 04:5731,990108,213,99970,977,0008,997,0002,473,984
11Dec 23, 2025 04:5832,004113,369,62972,010,0008,001,0002,482,176
12Dec 23, 2025 04:5832,006106,924,35174,013,0006,001,0002,482,176
13Dec 23, 2025 04:5732,023108,590,77571,051,0009,006,0002,465,792
14Dec 23, 2025 04:5832,025107,096,41573,058,0007,005,0002,453,504
15Dec 23, 2025 04:5832,030105,172,69373,068,0007,006,0002,465,792
16Dec 23, 2025 04:5732,033105,092,59474,076,0006,006,0002,314,240
17Dec 23, 2025 04:5832,049105,255,23771,109,0009,013,0002,461,696
18Dec 23, 2025 04:5832,058109,228,72770,126,00010,018,0002,482,176
19Dec 23, 2025 04:5832,099103,741,81271,220,0009,027,0002,478,080
20Dec 23, 2025 04:5832,172108,341,67872,388,0008,043,0002,469,888
21Dec 23, 2025 04:5732,340110,575,04871,866,0008,983,0002,482,176