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 05:41highload-churnerhighload-churnerScore: 1,394Success
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 05:411,36312,444,6673,408,0000524,288
2Nov 8, 2026 05:411,36512,884,3323,413,0000524,288
3Nov 8, 2026 05:411,38312,397,9543,458,0000524,288
4Nov 8, 2026 05:411,39012,511,2483,475,0000524,288
5Nov 8, 2026 05:411,39412,427,5403,485,0000524,288
6Nov 8, 2026 05:411,39412,399,2353,487,0000524,288
7Nov 8, 2026 05:411,39812,479,3483,497,0000524,288
8Nov 8, 2026 05:411,41912,537,2963,549,0000524,288
9Nov 8, 2026 05:411,50913,005,0642,666,0001,107,000524,288