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 19:40Josu San MartinJosu San MartinScore: 50,149Success
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 19:4050,032154,776,895117,075,0008,005,0002,351,104
2Jan 1, 2026 19:4050,149149,741,231118,352,0007,020,0002,453,504
3Jan 1, 2026 19:4050,356150,343,496119,895,0005,994,0002,502,656