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 10, 2026 00:34highload-churnerhighload-churnerScore: 3,411Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 02:063,37318,736,4577,375,0001,058,0002,117,632
2Oct 10, 2026 02:063,40918,795,1767,161,0001,362,0002,117,632
3Oct 10, 2026 02:063,40918,780,3287,159,0001,364,0002,117,632
4Oct 10, 2026 02:063,40918,738,5517,165,0001,358,0002,117,632
5Oct 10, 2026 02:063,41118,828,1947,460,0001,069,0002,117,632
6Oct 10, 2026 02:063,41318,779,7707,174,0001,360,0002,117,632
7Oct 10, 2026 02:063,41918,873,2487,195,0001,353,0002,117,632
8Oct 10, 2026 02:063,42518,819,0717,490,0001,073,0002,117,632
9Oct 10, 2026 02:063,42718,756,7077,498,0001,070,0002,117,632