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 16, 2025 13:56Aniruddha DebAniruddha DebScore: 8,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 16, 2025 13:568,73248,009,87216,868,0004,961,0002,338,816
2Nov 16, 2025 13:538,74850,464,54817,893,0003,976,0002,342,912
3Nov 16, 2025 13:568,77548,680,63718,947,0002,991,0002,342,912
4Nov 16, 2025 13:538,78349,825,02716,968,0004,990,0002,334,720
5Nov 16, 2025 13:568,79050,232,87618,978,0002,996,0002,347,008
6Nov 16, 2025 13:568,79240,014,60618,984,0002,997,0002,347,008
7Nov 16, 2025 13:538,79346,061,48716,986,0004,996,0002,338,816
8Nov 16, 2025 13:568,80451,666,34719,010,0003,001,0002,347,008
9Nov 16, 2025 13:568,96245,686,16119,351,0003,055,0002,342,912