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 30, 2026 06:52Victor MerckléVictor MerckléScore: 2,558Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 06:542,52414,161,7474,978,0001,332,0002,113,536
2May 30, 2026 06:542,52815,366,1394,988,0001,333,0002,113,536
3May 30, 2026 06:542,53014,033,0224,993,0001,333,0002,113,536
4May 30, 2026 06:542,55015,656,7175,041,0001,336,0002,113,536
5May 30, 2026 06:542,55816,036,1365,044,0001,352,0002,113,536
6May 30, 2026 06:542,63915,040,5295,258,0001,340,0002,113,536
7May 30, 2026 06:542,64014,327,2245,271,0001,331,0002,113,536
8May 30, 2026 06:542,64014,316,3895,268,0001,332,0002,113,536
9May 30, 2026 06:542,68416,115,0554,440,0002,270,0002,113,536