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 listMay 16, 2026 23:15M-RochatM-RochatScore: 4,432Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 23:154,41419,742,3329,962,0001,073,0002,113,536
2May 16, 2026 23:154,42519,770,0429,990,0001,074,0002,113,536
3May 16, 2026 23:154,42620,138,9919,991,0001,075,0002,113,536
4May 16, 2026 23:154,43019,709,90310,006,0001,071,0002,117,632
5May 16, 2026 23:154,43219,776,39110,004,0001,076,0002,121,728
6May 16, 2026 23:154,43419,783,23310,011,0001,076,0002,121,728
7May 16, 2026 23:154,43719,817,82510,020,0001,073,0002,113,536
8May 16, 2026 23:154,44219,807,40010,031,0001,075,0002,117,632
9May 16, 2026 23:154,46219,837,48010,075,0001,080,0002,117,632