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 07:42highload-churnerhighload-churnerScore: 1,312Success
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 07:431,21912,106,6561,999,0001,049,000524,288
2Nov 8, 2026 07:431,23412,184,3192,050,0001,035,000524,288
3Nov 8, 2026 07:431,25812,264,2291,560,0001,587,000524,288
4Nov 8, 2026 07:431,27212,298,1942,127,0001,055,000524,288
5Nov 8, 2026 07:431,31212,456,4312,036,0001,246,000524,288
6Nov 8, 2026 07:431,31912,353,9982,256,0001,043,000524,288
7Nov 8, 2026 07:431,33414,066,5202,270,0001,067,000524,288
8Nov 8, 2026 07:431,34612,438,2212,320,0001,045,000524,288
9Nov 8, 2026 07:431,34912,395,7292,322,0001,052,000524,288