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 15:23Victor MerckléVictor MerckléScore: 2,589Success
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 15:252,49813,794,4184,919,0001,327,0002,113,536
2Jun 1, 2026 15:252,51213,806,3854,950,0001,331,0002,113,536
3Jun 1, 2026 15:252,54113,881,2264,999,0001,354,0002,113,536
4Jun 1, 2026 15:252,57713,965,6295,116,0001,328,0002,113,536
5Jun 1, 2026 15:252,58913,978,8625,144,0001,329,0002,113,536
6Jun 1, 2026 15:252,59024,407,9295,143,0001,333,0002,109,440
7Jun 1, 2026 15:252,60314,498,4935,176,0001,333,0002,113,536
8Jun 1, 2026 15:252,60614,268,5255,184,0001,332,0002,113,536
9Jun 1, 2026 15:252,66614,143,3304,388,0002,278,0002,113,536