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 listOct 19, 2026 13:03highload-churnerhighload-churnerScore: 1,628Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 13:031,58213,163,8842,631,0001,326,000524,288
2Oct 19, 2026 13:031,58613,687,5762,658,0001,307,000524,288
3Oct 19, 2026 13:031,60413,765,4632,687,0001,324,000524,288
4Oct 19, 2026 13:031,61713,243,3462,720,0001,323,000524,288
5Oct 19, 2026 13:031,62813,635,2902,714,0001,356,000524,288
6Oct 19, 2026 13:031,63013,283,8583,022,0001,053,000524,288
7Oct 19, 2026 13:031,63613,310,5803,036,0001,054,000524,288
8Oct 19, 2026 13:031,64414,364,3862,755,0001,357,000524,288
9Oct 19, 2026 13:031,66413,741,1912,810,0001,351,000524,288