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:16highload-churnerhighload-churnerScore: 1,293Success
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:171,13711,948,3772,844,0000524,288
2Nov 8, 2026 08:171,13813,380,5342,845,0000524,288
3Nov 8, 2026 08:171,14811,981,5381,828,0001,044,000524,288
4Nov 8, 2026 08:171,15712,120,5201,488,0001,405,000524,288
5Nov 8, 2026 08:171,29313,016,8722,186,0001,047,000524,288
6Nov 8, 2026 08:171,30712,390,3562,229,0001,040,000524,288
7Nov 8, 2026 08:171,31212,753,6541,807,0001,474,000524,288
8Nov 8, 2026 08:171,31412,387,4511,873,0001,413,000524,288
9Nov 8, 2026 08:171,32112,689,0832,015,0001,289,000524,288