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 14, 2025 16:39izotoffizotoffScore: 34,820Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 14, 2025 16:3934,785112,662,77582,965,0003,998,0002,330,624
2Nov 14, 2025 16:3934,796114,046,88982,991,0003,999,0002,359,296
3Nov 14, 2025 16:3934,808112,755,65683,019,0004,000,0002,310,144
4Nov 14, 2025 16:3934,817118,498,17283,041,0004,002,0002,310,144
5Nov 14, 2025 16:3934,820111,343,02785,050,0002,001,0002,322,432
6Nov 14, 2025 16:3934,826111,778,94784,064,0003,002,0002,375,680
7Nov 14, 2025 16:3934,854114,629,99284,130,0003,004,0002,523,136
8Nov 14, 2025 16:3934,932111,806,99781,308,0006,022,0002,310,144
9Nov 14, 2025 16:3934,941118,715,47684,340,0003,012,0002,318,336