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 listMay 17, 2026 15:35Jacob McDanielJacob McDanielScore: 7,788Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 15:367,67631,591,30116,961,0002,231,0002,113,536
2May 17, 2026 15:367,76130,539,10517,144,0002,260,0002,113,536
3May 17, 2026 15:367,77029,769,52517,213,0002,213,0002,113,536
4May 17, 2026 15:367,78528,933,93617,209,0002,255,0002,113,536
5May 17, 2026 15:367,78828,996,18017,240,0002,231,0002,113,536
6May 17, 2026 15:367,79528,730,27517,268,0002,220,0002,113,536
7May 17, 2026 15:367,85429,761,15317,390,0002,246,0002,113,536
8May 17, 2026 15:367,90329,065,69717,456,0002,302,0002,113,536
9May 17, 2026 15:367,98530,687,55917,694,0002,270,0002,113,536