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:55Victor MerckléVictor MerckléScore: 2,571Success
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:572,51714,968,6114,967,0001,327,0002,113,536
2May 29, 2026 22:572,52514,097,4114,986,0001,328,0002,113,536
3May 29, 2026 22:572,53815,455,7355,016,0001,331,0002,113,536
4May 29, 2026 22:572,55314,211,5145,037,0001,346,0002,113,536
5May 29, 2026 22:572,57114,710,4385,083,0001,345,0002,113,536
6May 29, 2026 22:572,57115,128,5035,100,0001,328,0002,113,536
7May 29, 2026 22:572,58915,064,8275,146,0001,328,0002,113,536
8May 29, 2026 22:572,61215,025,8595,201,0001,330,0002,113,536
9May 29, 2026 22:572,63016,476,7565,250,0001,325,0002,113,536