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 3, 2026 00:24Andrew EpsteinAndrew EpsteinScore: 1,270Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 00:311,17311,990,1202,934,0000524,288
2Nov 3, 2026 00:311,20222,863,5613,005,0000524,288
3Nov 3, 2026 00:311,26512,205,4973,164,0000524,288
4Nov 3, 2026 00:311,26912,365,4293,173,0000524,288
5Nov 3, 2026 00:311,27012,325,0923,175,0000524,288
6Nov 3, 2026 00:311,27112,260,7763,178,0000524,288
7Nov 3, 2026 00:311,27512,354,2403,188,0000524,288
8Nov 3, 2026 00:311,27612,171,2653,190,0000524,288
9Nov 3, 2026 00:311,32612,367,7403,315,0000524,288