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 listNov 27, 2024 15:46Joad NacerJoad NacerScore: 34,256Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 27, 2024 15:4634,214119,027,76382,518,0003,018,0002,301,952
2Nov 27, 2024 15:4634,230110,614,86681,547,0004,027,0002,289,664
3Nov 27, 2024 15:4634,231111,673,34580,544,0005,034,0002,281,472
4Nov 27, 2024 15:4634,256112,222,24384,633,0001,007,0002,281,472
5Nov 27, 2024 15:4634,256113,848,04384,633,0001,007,0002,322,432
6Nov 27, 2024 15:4634,264119,920,07281,629,0004,031,0002,297,856
7Nov 27, 2024 15:4634,306121,305,63983,770,0001,994,0002,506,752
8Nov 27, 2024 15:4634,346116,303,40782,870,0002,995,0002,383,872
9Nov 27, 2024 15:4634,410116,003,94384,026,0002,000,0002,371,584