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 11:26Andrey LikhachevAndrey LikhachevScore: 30,054Success
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 11:2629,942104,248,43170,864,0003,992,000679,936
2Feb 3, 2025 11:2629,952103,629,30970,888,0003,993,000905,216
3Feb 3, 2025 11:2630,017100,775,55273,041,0002,001,000892,928
4Feb 3, 2025 11:2630,027102,259,36270,064,0005,004,000675,840
5Feb 3, 2025 11:2630,054104,874,13073,132,0002,003,000679,936
6Feb 3, 2025 11:2630,082103,300,41871,195,0004,011,000790,528
7Feb 3, 2025 11:2630,116104,235,91272,280,0003,011,000905,216
8Feb 3, 2025 11:2630,117110,150,40670,274,0005,019,000679,936
9Feb 3, 2025 11:2630,338106,324,40971,855,0003,991,000675,840