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 listApr 21, 2026 09:20Dominique GarmierDominique GarmierScore: 8,356Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 09:208,24252,182,60414,425,0006,182,0002,256,896
2Apr 21, 2026 09:208,31650,540,60015,842,0004,950,0002,379,776
3Apr 21, 2026 09:208,35045,403,13214,912,0005,965,0002,256,896
4Apr 21, 2026 09:208,35448,328,33414,918,0005,967,0002,510,848
5Apr 21, 2026 09:208,35647,560,36617,907,0002,984,0002,510,848
6Apr 21, 2026 09:208,36050,509,05811,944,0008,958,0002,256,896
7Apr 21, 2026 09:208,42043,789,30617,042,0004,010,0002,510,848
8Apr 21, 2026 09:208,47141,484,72218,154,0003,025,0002,265,088
9Apr 21, 2026 09:208,51243,187,63115,201,0006,080,0002,510,848