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:05highload-churnerhighload-churnerScore: 1,311Success
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:051,14411,972,2621,825,0001,036,000524,288
2Nov 8, 2026 08:051,22812,178,3192,026,0001,044,000524,288
3Nov 8, 2026 08:051,28112,361,3482,190,0001,014,000524,288
4Nov 8, 2026 08:051,28912,337,4041,977,0001,246,000524,288
5Nov 8, 2026 08:051,31112,340,4882,241,0001,037,000524,288
6Nov 8, 2026 08:051,32012,688,2202,261,0001,040,000524,288
7Nov 8, 2026 08:051,32112,368,9432,258,0001,046,000524,288
8Nov 8, 2026 08:051,32512,411,4511,848,0001,466,000524,288
9Nov 8, 2026 08:051,35212,409,1992,320,0001,060,000524,288