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 07:18highload-churnerhighload-churnerScore: 1,344Success
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 07:181,16011,995,0411,875,0001,025,000524,288
2Nov 8, 2026 07:181,16013,833,7481,874,0001,028,000524,288
3Nov 8, 2026 07:181,16611,982,8711,463,0001,453,000524,288
4Nov 8, 2026 07:181,21212,109,7801,984,0001,046,000524,288
5Nov 8, 2026 07:181,34412,529,1782,330,0001,032,000524,288
6Nov 8, 2026 07:181,34812,511,5192,352,0001,018,000524,288
7Nov 8, 2026 07:181,35012,548,2842,332,0001,045,000524,288
8Nov 8, 2026 07:181,36212,418,7182,345,0001,060,000524,288
9Nov 8, 2026 07:181,36412,407,7442,354,0001,056,000524,288