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 23:43Andrew EpsteinAndrew EpsteinScore: 1,303Success
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 23:491,17212,107,8182,930,00002,117,632
2Nov 2, 2026 23:491,17212,174,6332,931,00002,117,632
3Nov 2, 2026 23:491,18012,136,0112,951,00002,117,632
4Nov 2, 2026 23:491,25512,876,6843,139,00002,117,632
5Nov 2, 2026 23:491,30312,588,7582,223,0001,036,0002,117,632
6Nov 2, 2026 23:491,30412,928,4102,227,0001,033,0002,117,632
7Nov 2, 2026 23:491,30412,922,1252,230,0001,030,0002,117,632
8Nov 2, 2026 23:491,30712,908,0182,229,0001,040,0002,117,632
9Nov 2, 2026 23:491,31112,944,2572,232,0001,047,0002,117,632