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:49Joad NacerJoad NacerScore: 34,214Success
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:4934,120110,812,95382,290,0003,010,0002,306,048
2Nov 27, 2024 15:4934,146112,687,23082,353,0003,012,0002,441,216
3Nov 27, 2024 15:4934,198109,565,81782,478,0003,017,0002,301,952
4Nov 27, 2024 15:4934,199115,989,21583,486,0002,011,0002,297,856
5Nov 27, 2024 15:4934,214116,695,43882,517,0003,018,0002,277,376
6Nov 27, 2024 15:4934,251111,728,72684,621,0001,007,0002,318,336
7Nov 27, 2024 15:4934,265112,031,72883,648,0002,015,0002,478,080
8Nov 27, 2024 15:4934,285115,134,97683,719,0001,993,0002,408,448
9Nov 27, 2024 15:4934,392110,611,88283,980,0001,999,0002,482,176