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 10:06Victor MerckléVictor MerckléScore: 2,516Success
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 10:072,50413,825,1974,937,0001,323,0002,113,536
2Jun 1, 2026 10:072,50913,856,0414,948,0001,326,0002,113,536
3Jun 1, 2026 10:072,51113,853,3774,956,0001,323,0002,113,536
4Jun 1, 2026 10:072,51513,890,8034,961,0001,327,0002,113,536
5Jun 1, 2026 10:072,51613,823,4524,967,0001,325,0002,113,536
6Jun 1, 2026 10:072,55613,951,0215,048,0001,342,0002,113,536
7Jun 1, 2026 10:072,59013,966,2405,154,0001,322,0002,113,536
8Jun 1, 2026 10:072,59614,010,8905,167,0001,324,0002,113,536
9Jun 1, 2026 10:072,60013,971,4515,182,0001,320,0002,113,536