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 10:10Victor MerckléVictor MerckléScore: 2,679Success
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 10:112,64514,374,4045,271,0001,342,0002,113,536
2May 29, 2026 10:112,65714,933,8515,298,0001,346,0002,113,536
3May 29, 2026 10:112,66116,195,3195,303,0001,350,0002,113,536
4May 29, 2026 10:112,67814,998,0095,335,0001,361,0002,113,536
5May 29, 2026 10:112,67915,007,4605,339,0001,360,0002,113,536
6May 29, 2026 10:112,77617,470,7325,600,0001,340,0002,113,536
7May 29, 2026 10:112,77817,511,2905,601,0001,344,0002,113,536
8May 29, 2026 10:112,78216,345,0645,611,0001,346,0002,113,536
9May 29, 2026 10:112,80318,107,1035,649,0001,360,0002,113,536