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 listAug 16, 2026 00:03marko1597marko1597Score: 1,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 00:331,60712,378,2172,853,0001,165,0002,113,536
2Aug 16, 2026 00:331,60812,337,0372,840,0001,180,0002,113,536
3Aug 16, 2026 00:331,60912,397,2652,831,0001,193,0002,113,536
4Aug 16, 2026 00:331,61012,401,0092,852,0001,175,0002,113,536
5Aug 16, 2026 00:331,61213,508,9922,855,0001,175,0002,113,536
6Aug 16, 2026 00:331,71412,737,3603,090,0001,197,0002,113,536
7Aug 16, 2026 00:331,74012,691,9343,141,0001,211,0002,113,536
8Aug 16, 2026 00:331,74612,730,4623,140,0001,227,0002,113,536
9Aug 16, 2026 00:331,75212,795,2193,149,0001,232,0002,113,536