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 12, 2025 14:05Yehor BondarYehor BondarScore: 377,176Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2025 14:05377,061969,678,312941,654,000999,0002,420,736
2Nov 12, 2025 14:05377,112970,180,541941,782,000999,0002,289,664
3Nov 12, 2025 14:05377,136966,964,999942,839,00002,289,664
4Nov 12, 2025 14:05377,158966,504,220942,894,00002,281,472
5Nov 12, 2025 14:05377,176972,191,559940,941,0001,999,0002,289,664
6Nov 12, 2025 14:05377,187969,418,141941,969,000999,0002,412,544
7Nov 12, 2025 14:05377,208966,081,174943,021,00002,424,832
8Nov 12, 2025 14:05377,212970,270,794943,030,00002,416,640
9Nov 12, 2025 14:05377,212966,396,725942,031,0001,000,0002,428,928