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 09:15highload-churnerhighload-churnerScore: 1,215Success
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 09:151,12811,983,6701,474,0001,348,000524,288
2Nov 8, 2026 09:151,14511,915,2971,439,0001,424,000524,288
3Nov 8, 2026 09:151,19811,981,4541,963,0001,032,000524,288
4Nov 8, 2026 09:151,19812,050,5961,958,0001,038,000524,288
5Nov 8, 2026 09:151,21512,102,0791,983,0001,056,000524,288
6Nov 8, 2026 09:151,22412,111,3931,865,0001,196,000524,288
7Nov 8, 2026 09:151,23212,234,4752,063,0001,017,000524,288
8Nov 8, 2026 09:151,23712,106,1391,729,0001,364,000524,288
9Nov 8, 2026 09:151,27412,239,0252,118,0001,067,000524,288