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 listMar 4, 2026 18:12olliecrowolliecrowScore: 41,477Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 18:1241,374124,600,43399,418,0004,016,0002,519,040
2Mar 4, 2026 18:1241,477136,271,781100,672,0003,020,0002,379,776
3Mar 4, 2026 18:1241,503128,198,058102,760,000997,0002,510,848