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 9, 2026 00:51highload-churnerhighload-churnerScore: 1,263Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 9, 2026 00:511,21612,039,3231,996,0001,044,000524,288
2Nov 9, 2026 00:511,23015,914,2941,887,0001,189,000524,288
3Nov 9, 2026 00:511,24612,282,8702,092,0001,025,000524,288
4Nov 9, 2026 00:511,26212,106,8882,106,0001,051,000524,288
5Nov 9, 2026 00:511,26312,179,3922,104,0001,054,000524,288
6Nov 9, 2026 00:511,27112,404,0772,156,0001,023,000524,288
7Nov 9, 2026 00:511,28712,255,9562,160,0001,058,000524,288
8Nov 9, 2026 00:511,28912,667,3192,162,0001,061,000524,288
9Nov 9, 2026 00:511,29112,257,2242,189,0001,039,000524,288