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 29, 2025 11:14NoSIMD_C#NoSIMD_C#Score: 1,137,544Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2024 16:251,134,9702,868,178,4022,835,428,0001,998,0002,273,280
2Jan 29, 2025 11:141,135,5282,865,182,6212,838,820,00002,273,280
3Dec 8, 2024 16:251,135,8502,869,765,6082,838,627,000999,0002,273,280
4Dec 8, 2024 16:251,135,9102,867,601,7552,838,776,000999,0002,273,280
5Jan 29, 2025 11:141,136,4322,871,506,9882,839,083,0001,998,0002,461,696
6Dec 8, 2024 16:251,136,6462,868,702,0932,840,615,000999,0002,273,280
7Jan 29, 2025 11:141,136,7052,871,447,6652,841,763,00002,457,600
8Jan 29, 2025 11:141,136,7822,871,868,0582,840,957,000999,0002,273,280
9Dec 8, 2024 16:251,136,8472,866,667,2522,840,119,0001,998,0002,273,280
10Jan 29, 2025 11:141,137,5442,868,769,4142,842,860,000999,0002,273,280
11Jan 29, 2025 11:141,138,1132,868,148,7552,843,284,0001,998,0002,281,472
12Dec 8, 2024 16:251,138,6022,870,805,7692,845,506,000999,0002,273,280
13Jan 29, 2025 11:141,138,9002,869,759,1592,846,250,000999,0002,273,280
14Dec 8, 2024 16:251,139,2862,877,886,2312,848,215,00002,461,696
15Dec 8, 2024 16:251,140,5382,878,701,8682,848,347,0002,998,0002,461,696
16Jan 29, 2025 11:141,141,2362,880,223,8122,851,093,0001,998,0002,273,280
17Jan 29, 2025 11:141,141,5932,882,599,2152,852,984,000999,0002,273,280
18Dec 8, 2024 16:251,142,9212,889,719,5562,856,303,000999,0002,457,600