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 4, 2026 08:25Victor MerckléVictor MerckléScore: 3,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 08:273,02523,649,0746,357,0001,207,0002,465,792
2May 4, 2026 08:273,04222,734,5476,396,0001,211,0002,469,888
3May 4, 2026 08:273,04323,326,2286,392,0001,216,0002,465,792
4May 4, 2026 08:273,05622,823,6596,426,0001,216,0002,465,792
5May 4, 2026 08:273,10522,988,0725,614,0002,149,0002,465,792
6May 4, 2026 08:273,11123,895,0456,561,0001,217,0002,469,888
7May 4, 2026 08:273,12424,641,2995,641,0002,170,0002,465,792
8May 4, 2026 08:273,18123,200,3685,787,0002,166,0002,465,792
9May 4, 2026 08:273,18423,554,4736,740,0001,222,0002,461,696