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 20, 2026 14:21Victor MerckléVictor MerckléScore: 2,844Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 14:222,71216,248,0515,433,0001,347,0002,113,536
2May 20, 2026 14:222,72115,201,2715,454,0001,349,0002,113,536
3May 20, 2026 14:222,82414,745,2765,722,0001,340,0002,113,536
4May 20, 2026 14:222,83014,948,8405,731,0001,345,0002,113,536
5May 20, 2026 14:222,84415,280,9145,765,0001,346,0002,113,536
6May 20, 2026 14:222,85015,871,3445,766,0001,360,0002,113,536
7May 20, 2026 14:222,85715,083,1465,798,0001,346,0002,113,536
8May 20, 2026 14:222,90415,951,4334,938,0002,322,0002,113,536
9May 20, 2026 14:222,92015,025,6764,952,0002,350,0002,113,536