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 17:26Victor MerckléVictor MerckléScore: 2,602Success
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 17:282,57015,463,9755,120,0001,305,0002,113,536
2May 29, 2026 17:282,58115,959,1075,143,0001,311,0002,113,536
3May 29, 2026 17:282,58316,378,4015,149,0001,309,0002,113,536
4May 29, 2026 17:282,58814,969,7345,157,0001,315,0002,113,536
5May 29, 2026 17:282,60216,003,7035,187,0001,319,0002,113,536
6May 29, 2026 17:282,62716,609,3275,257,0001,311,0002,113,536
7May 29, 2026 17:282,65614,521,0405,297,0001,343,0002,113,536
8May 29, 2026 17:282,70616,080,6535,452,0001,314,0002,113,536
9May 29, 2026 17:282,75816,555,8285,562,0001,335,0002,113,536