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 16, 2026 05:49Victor MerckléVictor MerckléScore: 1,724Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 05:521,70411,678,2733,060,0001,201,0002,113,536
2Jun 16, 2026 05:521,70511,689,6893,056,0001,207,0002,113,536
3Jun 16, 2026 05:521,71711,708,5753,081,0001,212,0002,113,536
4Jun 16, 2026 05:521,71811,677,4493,083,0001,213,0002,113,536
5Jun 16, 2026 05:521,72411,596,8033,099,0001,213,0002,113,536
6Jun 16, 2026 05:521,73111,771,0073,113,0001,216,0002,113,536
7Jun 16, 2026 05:521,77211,849,7393,074,0001,358,0002,113,536
8Jun 16, 2026 05:521,83611,986,1413,442,0001,148,0002,113,536
9Jun 16, 2026 05:521,86912,111,6343,463,0001,210,0002,113,536