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 09:46highload-churnerhighload-churnerScore: 1,296Success
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 09:471,22812,248,3302,056,0001,014,000524,288
2Nov 8, 2026 09:471,27212,200,0941,747,0001,434,000524,288
3Nov 8, 2026 09:471,28412,292,8192,172,0001,039,000524,288
4Nov 8, 2026 09:471,29512,381,0551,924,0001,315,000524,288
5Nov 8, 2026 09:471,29612,630,3452,187,0001,053,000524,288
6Nov 8, 2026 09:471,30012,332,2732,202,0001,050,000524,288
7Nov 8, 2026 09:471,30912,335,3652,205,0001,068,000524,288
8Nov 8, 2026 09:471,31812,420,4372,249,0001,046,000524,288
9Nov 8, 2026 09:471,32212,401,9702,263,0001,042,000524,288