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:56highload-churnerhighload-churnerScore: 1,244Success
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:571,11511,887,0091,443,0001,345,000524,288
2Nov 8, 2026 08:571,14511,918,4891,569,0001,295,000524,288
3Nov 8, 2026 08:571,14711,923,7941,576,0001,292,000524,288
4Nov 8, 2026 08:571,19211,999,4331,935,0001,047,000524,288
5Nov 8, 2026 08:571,24412,213,8031,932,0001,178,000524,288
6Nov 8, 2026 08:571,25312,259,0392,088,0001,046,000524,288
7Nov 8, 2026 08:571,27412,679,3992,131,0001,055,000524,288
8Nov 8, 2026 08:571,28012,388,6801,896,0001,305,000524,288
9Nov 8, 2026 08:571,30012,303,2432,195,0001,055,000524,288