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 12:57highload-churnerhighload-churnerScore: 1,423Success
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 12:571,36612,709,6092,064,0001,351,000524,288
2Oct 19, 2026 12:571,39212,702,1322,406,0001,076,000524,288
3Oct 19, 2026 12:571,39612,700,0552,407,0001,084,000524,288
4Oct 19, 2026 12:571,40112,732,1782,119,0001,385,000524,288
5Oct 19, 2026 12:571,42312,795,7862,159,0001,399,000524,288
6Oct 19, 2026 12:571,53614,586,7602,539,0001,302,000524,288
7Oct 19, 2026 12:571,57213,256,4042,628,0001,304,000524,288
8Oct 19, 2026 12:571,61413,234,0912,981,0001,054,000524,288
9Oct 19, 2026 12:571,61613,273,1642,701,0001,340,000524,288