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:24highload-churnerhighload-churnerScore: 1,236Success
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:241,15111,901,6851,856,0001,023,000524,288
2Nov 8, 2026 08:241,20012,029,6641,968,0001,033,000524,288
3Nov 8, 2026 08:241,21412,178,1462,007,0001,029,000524,288
4Nov 8, 2026 08:241,23312,197,4592,063,0001,021,000524,288
5Nov 8, 2026 08:241,23612,145,1652,031,0001,060,000524,288
6Nov 8, 2026 08:241,24012,181,7882,064,0001,038,000524,288
7Nov 8, 2026 08:241,25112,237,6612,081,0001,048,000524,288
8Nov 8, 2026 08:241,26812,153,1552,119,0001,052,000524,288
9Nov 8, 2026 08:241,27012,242,7542,136,0001,040,000524,288