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 listDec 29, 2025 16:11Josu San MartinJosu San MartinScore: 27,439Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 16:1127,392100,695,19462,438,0006,042,0002,322,432
2Dec 29, 2025 16:1127,43998,428,30961,537,0007,061,0002,510,848
3Dec 29, 2025 16:1128,02297,267,56263,050,0007,005,0002,510,848