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 8, 2026 08:22highload-churnerhighload-churnerScore: 1,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2026 08:221,13211,962,1031,801,0001,029,000524,288
2Nov 8, 2026 08:221,14511,980,9431,634,0001,230,000524,288
3Nov 8, 2026 08:221,25712,237,1721,793,0001,350,000524,288
4Nov 8, 2026 08:221,27612,306,7932,170,0001,020,000524,288
5Nov 8, 2026 08:221,28313,809,5052,171,0001,037,000524,288
6Nov 8, 2026 08:221,31512,813,0792,232,0001,056,000524,288
7Nov 8, 2026 08:221,32112,450,6612,235,0001,068,000524,288
8Nov 8, 2026 08:221,32812,308,8652,264,0001,057,000524,288
9Nov 8, 2026 08:221,33312,396,4012,283,0001,050,000524,288