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 listAug 15, 2026 09:27Tomislav TunkovicTomislav TunkovicScore: 3,034Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 09:282,97215,837,3566,289,0001,142,0002,125,824stderr
2Aug 15, 2026 09:282,97415,664,2206,274,0001,163,0002,125,824stderr
3Aug 15, 2026 09:283,01015,751,5216,312,0001,213,0002,125,824stderr
4Aug 15, 2026 09:283,03015,794,8936,369,0001,206,0002,125,824stderr
5Aug 15, 2026 09:283,03416,020,6876,398,0001,187,0002,125,824stderr
6Aug 15, 2026 09:283,05415,812,0706,441,0001,195,0002,125,824stderr
7Aug 15, 2026 09:283,14016,249,0826,648,0001,204,0002,125,824stderr
8Aug 15, 2026 09:283,16317,005,0396,725,0001,184,0002,125,824stderr
9Aug 15, 2026 09:283,16516,108,8336,704,0001,210,0002,125,824stderr