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 07:48highload-churnerhighload-churnerScore: 1,274Success
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 07:481,11011,954,8131,774,0001,003,000524,288
2Nov 8, 2026 07:481,13711,977,9261,437,0001,407,000524,288
3Nov 8, 2026 07:481,14211,913,9501,824,0001,031,000524,288
4Nov 8, 2026 07:481,14311,928,3431,623,0001,235,000524,288
5Nov 8, 2026 07:481,27412,261,4662,140,0001,045,000524,288
6Nov 8, 2026 07:481,28612,268,3792,175,0001,040,000524,288
7Nov 8, 2026 07:481,29012,378,4721,980,0001,246,000524,288
8Nov 8, 2026 07:481,31812,712,6072,245,0001,050,000524,288
9Nov 8, 2026 07:481,31812,371,3122,260,0001,037,000524,288