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 listJan 5, 2026 02:38Josu San MartinJosu San MartinScore: 11,394Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 02:3811,37756,810,33522,348,0006,094,0002,498,560
2Jan 5, 2026 02:3811,39453,374,71024,415,0004,069,0002,281,472
3Jan 5, 2026 02:3811,39756,462,99225,440,0003,052,0002,502,656