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 7, 2026 12:06Victor MerckléVictor MerckléScore: 1,861Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 12:081,73012,004,7583,112,0001,213,0002,113,536
2Jun 7, 2026 12:081,73312,011,2323,121,0001,213,0002,113,536
3Jun 7, 2026 12:081,75412,079,1523,174,0001,213,0002,113,536
4Jun 7, 2026 12:081,82812,257,0763,365,0001,207,0002,113,536
5Jun 7, 2026 12:081,86112,389,8543,437,0001,217,0002,113,536
6Jun 7, 2026 12:081,86312,685,2463,449,0001,210,0002,113,536
7Jun 7, 2026 12:081,86614,034,6233,436,0001,231,0002,113,536
8Jun 7, 2026 12:081,87712,733,4883,523,0001,170,0002,113,536
9Jun 7, 2026 12:081,88312,701,1233,481,0001,228,0002,113,536