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 listJun 1, 2026 12:48Victor MerckléVictor MerckléScore: 2,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 12:502,51513,760,1594,960,0001,328,0002,113,536
2Jun 1, 2026 12:502,52813,849,9164,986,0001,334,0002,113,536
3Jun 1, 2026 12:502,56513,899,1915,064,0001,350,0002,113,536
4Jun 1, 2026 12:502,60913,893,8925,199,0001,324,0002,113,536
5Jun 1, 2026 12:502,61113,961,3115,205,0001,324,0002,113,536
6Jun 1, 2026 12:502,61914,055,1285,219,0001,330,0002,113,536
7Jun 1, 2026 12:502,62213,962,2525,225,0001,331,0002,113,536
8Jun 1, 2026 12:502,64214,024,3585,263,0001,343,0002,113,536
9Jun 1, 2026 12:502,64714,057,9525,284,0001,334,0002,113,536