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 8, 2026 08:48highload-churnerhighload-churnerScore: 1,260Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2026 08:491,14211,971,6902,856,0000524,288
2Nov 8, 2026 08:491,14511,918,6342,864,0000524,288
3Nov 8, 2026 08:491,22012,273,5551,800,0001,252,000524,288
4Nov 8, 2026 08:491,23812,309,9201,886,0001,209,000524,288
5Nov 8, 2026 08:491,26012,167,1682,108,0001,044,000524,288
6Nov 8, 2026 08:491,27012,180,8942,123,0001,052,000524,288
7Nov 8, 2026 08:491,27712,623,9172,134,0001,059,000524,288
8Nov 8, 2026 08:491,27812,473,5671,767,0001,430,000524,288
9Nov 8, 2026 08:491,28412,158,5102,142,0001,069,000524,288