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 30, 2026 03:08Victor MerckléVictor MerckléScore: 2,725Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 03:102,68314,639,0955,402,0001,307,0002,113,536
2May 30, 2026 03:102,69315,190,2825,422,0001,311,0002,113,536
3May 30, 2026 03:102,70214,583,6585,446,0001,311,0002,113,536
4May 30, 2026 03:102,72216,382,8205,476,0001,329,0002,113,536
5May 30, 2026 03:102,72517,089,3635,487,0001,326,0002,113,536
6May 30, 2026 03:102,77815,757,5165,635,0001,310,0002,113,536
7May 30, 2026 03:102,78314,772,9365,648,0001,311,0002,113,536
8May 30, 2026 03:102,78615,309,3175,652,0001,313,0002,113,536
9May 30, 2026 03:102,80817,943,6645,693,0001,327,0002,113,536