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 09:48Victor MerckléVictor MerckléScore: 2,529Success
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 09:502,49913,903,1814,924,0001,325,0002,113,536
2Jun 1, 2026 09:502,50613,830,1104,942,0001,324,0002,113,536
3Jun 1, 2026 09:502,50813,851,9864,945,0001,327,0002,113,536
4Jun 1, 2026 09:502,51613,869,3034,967,0001,324,0002,113,536
5Jun 1, 2026 09:502,52913,874,5694,997,0001,327,0002,113,536
6Jun 1, 2026 09:502,56013,979,0565,081,0001,321,0002,113,536
7Jun 1, 2026 09:502,61614,035,3165,209,0001,333,0002,113,536
8Jun 1, 2026 09:502,61714,068,5155,218,0001,326,0002,113,536
9Jun 1, 2026 09:502,65514,165,7485,293,0001,345,0002,113,536