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 listFeb 6, 2026 01:40Josu San MartinJosu San MartinScore: 5,794Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2026 01:405,73931,793,1239,224,0005,124,0002,465,792
2Feb 6, 2026 01:405,79436,958,13111,382,0003,104,0002,293,760
3Feb 6, 2026 01:405,88931,316,43012,619,0002,103,0002,367,488