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:24highload-churnerhighload-churnerScore: 1,262Success
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:241,14511,958,2161,439,0001,424,000524,288
2Nov 8, 2026 09:241,14911,984,3441,847,0001,027,000524,288
3Nov 8, 2026 09:241,23112,631,9011,818,0001,261,000524,288
4Nov 8, 2026 09:241,24212,679,8062,087,0001,018,000524,288
5Nov 8, 2026 09:241,26212,280,4752,106,0001,050,000524,288
6Nov 8, 2026 09:241,26312,238,7982,109,0001,049,000524,288
7Nov 8, 2026 09:241,27212,615,9602,145,0001,035,000524,288
8Nov 8, 2026 09:241,27512,229,4092,119,0001,070,000524,288
9Nov 8, 2026 09:241,32012,759,3141,852,0001,448,000524,288