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 29, 2026 22:09Victor MerckléVictor MerckléScore: 2,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 22:112,54415,322,7685,034,0001,328,0002,113,536
2May 29, 2026 22:112,54814,725,6765,047,0001,325,0002,113,536
3May 29, 2026 22:112,55115,615,6235,048,0001,330,0002,113,536
4May 29, 2026 22:112,55213,968,6115,050,0001,330,0002,113,536
5May 29, 2026 22:112,56015,012,7825,071,0001,330,0002,113,536
6May 29, 2026 22:112,58414,200,1835,113,0001,348,0002,113,536
7May 29, 2026 22:112,58914,115,9145,125,0001,348,0002,113,536
8May 29, 2026 22:112,60814,931,9845,191,0001,331,0002,113,536
9May 29, 2026 22:112,61815,103,8755,180,0001,365,0002,113,536