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 16, 2026 03:03Josu San MartinJosu San MartinScore: 15,249Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2026 03:0315,24261,675,77533,091,0005,013,0002,420,736
2Jan 16, 2026 03:0315,24957,310,28233,107,0005,016,0002,301,952
3Jan 16, 2026 03:0315,37267,385,07134,384,0004,045,0002,482,176