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 1, 2026 22:18Josu San MartinJosu San MartinScore: 13,761Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 22:1813,73257,306,21229,283,0005,048,0002,363,392
2Jan 1, 2026 22:1813,76164,454,45931,368,0003,035,0002,326,528
3Jan 1, 2026 22:1813,82961,468,53130,505,0004,067,0002,510,848