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 16:50Victor MerckléVictor MerckléScore: 2,544Success
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 16:522,52813,916,2784,995,0001,326,0002,113,536
2Jun 1, 2026 16:522,53013,976,6494,997,0001,329,0002,113,536
3Jun 1, 2026 16:522,53413,961,4105,011,0001,325,0002,113,536
4Jun 1, 2026 16:522,53913,952,2524,994,0001,354,0002,113,536
5Jun 1, 2026 16:522,54413,939,8045,031,0001,329,0002,113,536
6Jun 1, 2026 16:522,54413,810,6035,033,0001,329,0002,113,536
7Jun 1, 2026 16:522,57613,955,8705,104,0001,338,0002,113,536
8Jun 1, 2026 16:522,58314,125,6775,124,0001,335,0002,113,536
9Jun 1, 2026 16:522,62014,089,2005,219,0001,331,0002,113,536