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 listFeb 3, 2025 05:31NoSIMD_C#NoSIMD_C#Score: 1,137,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2025 05:311,135,5922,859,811,1312,834,984,0003,997,0002,273,280
2Feb 3, 2025 05:311,135,8822,861,664,8212,838,707,000999,0002,273,280
3Feb 3, 2025 05:311,136,7192,869,127,7962,840,799,000999,0002,281,472
4Feb 3, 2025 05:311,136,9592,866,558,9222,840,399,0001,998,0002,281,472
5Feb 3, 2025 05:311,137,2842,874,453,9822,842,210,000999,0002,461,696
6Feb 3, 2025 05:311,138,6612,873,183,0922,844,654,0001,999,0002,273,280
7Feb 3, 2025 05:311,139,4072,877,073,1622,847,519,000999,0002,498,560
8Feb 3, 2025 05:311,141,1552,875,050,6232,851,888,000999,0002,527,232
9Feb 3, 2025 05:311,141,5772,883,307,2592,852,944,000999,0002,535,424