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 listNov 2, 2026 21:37Andrew EpsteinAndrew EpsteinScore: 44,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2026 21:3744,486120,520,85890,043,00021,174,000540,672stderr
2Nov 2, 2026 21:3744,517120,568,03490,062,00021,232,000540,672stderr
3Nov 2, 2026 21:3744,529120,536,88690,038,00021,286,000540,672stderr
4Nov 2, 2026 21:3744,585120,612,24690,083,00021,380,000540,672stderr
5Nov 2, 2026 21:3744,613120,554,72890,201,00021,332,000540,672stderr
6Nov 2, 2026 21:3744,618121,136,59090,195,00021,351,000540,672stderr
7Nov 2, 2026 21:3744,634120,820,94390,236,00021,349,000540,672stderr
8Nov 2, 2026 21:3744,696120,950,73090,376,00021,365,000540,672stderr
9Nov 2, 2026 21:3744,714121,390,44990,552,00021,235,000540,672stderr