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 9, 2026 01:33highload-churnerhighload-churnerScore: 1,246Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 9, 2026 01:341,14311,971,0241,660,0001,199,000524,288
2Nov 9, 2026 01:341,17912,046,6671,929,0001,020,000524,288
3Nov 9, 2026 01:341,21012,131,1001,932,0001,094,000524,288
4Nov 9, 2026 01:341,23712,104,6252,050,0001,044,000524,288
5Nov 9, 2026 01:341,24612,272,7871,694,0001,422,000524,288
6Nov 9, 2026 01:341,25312,186,7731,618,0001,515,000524,288
7Nov 9, 2026 01:341,26412,219,7832,117,0001,043,000524,288
8Nov 9, 2026 01:341,28112,586,8872,157,0001,046,000524,288
9Nov 9, 2026 01:341,28612,263,1881,736,0001,480,000524,288