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 09:50Victor MerckléVictor MerckléScore: 3,087Success
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 09:522,95516,656,4006,089,0001,300,0002,113,536
2May 29, 2026 09:522,97017,209,8666,123,0001,304,0002,113,536
3May 29, 2026 09:522,97816,130,6736,143,0001,303,0002,113,536
4May 29, 2026 09:522,99016,838,4306,162,0001,315,0002,113,536
5May 29, 2026 09:523,08715,408,7136,419,0001,299,0002,113,536
6May 29, 2026 09:523,11416,411,0606,474,0001,311,0002,113,536
7May 29, 2026 09:523,11517,001,8906,459,0001,329,0002,113,536
8May 29, 2026 09:523,12718,463,7756,496,0001,322,0002,113,536
9May 29, 2026 09:523,12816,404,1826,534,0001,287,0002,113,536