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 5, 2024 14:31Andrey LikhachevAndrey LikhachevScore: 46,814Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2024 14:3146,769144,778,401114,924,0001,998,000782,336
2Jan 5, 2024 14:3146,782146,198,741115,957,000999,000917,504
3Jan 5, 2024 14:3146,787142,858,407115,969,000999,000778,240
4Jan 5, 2024 14:3146,799146,610,707115,999,000999,000696,320
5Jan 5, 2024 14:3146,808142,892,341115,019,0002,000,000696,320
6Jan 5, 2024 14:3146,813149,248,898115,032,0002,000,000786,432
7Jan 5, 2024 14:3146,814143,615,037115,035,0002,000,000782,336
8Jan 5, 2024 14:3146,822149,301,793115,054,0002,000,000790,528
9Jan 5, 2024 14:3146,846176,070,940117,116,16302,191,360
10Jan 5, 2024 14:3146,847151,771,445115,116,0002,002,000696,320
11Jan 5, 2024 14:3146,850177,118,754117,125,54402,203,648
12Jan 5, 2024 14:3146,861188,848,021117,151,94502,187,264