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:12Victor 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:142,55414,764,9995,058,0001,327,0002,113,536
2May 29, 2026 22:142,55814,178,6245,071,0001,325,0002,113,536
3May 29, 2026 22:142,55915,155,3475,071,0001,327,0002,113,536
4May 29, 2026 22:142,56015,390,7375,075,0001,326,0002,113,536
5May 29, 2026 22:142,56015,735,0755,072,0001,329,0002,113,536
6May 29, 2026 22:142,56415,926,6225,079,0001,332,0002,113,536
7May 29, 2026 22:142,59015,144,8205,133,0001,344,0002,113,536
8May 29, 2026 22:142,63816,157,2425,271,0001,326,0002,113,536
9May 29, 2026 22:142,70614,508,9054,478,0002,288,0002,113,536