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:11highload-churnerhighload-churnerScore: 1,260Success
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:111,13411,960,4411,767,0001,070,000524,288
2Nov 8, 2026 08:111,13811,927,9861,821,0001,025,000524,288
3Nov 8, 2026 08:111,13811,949,6751,463,0001,382,000524,288
4Nov 8, 2026 08:111,16611,971,5171,871,0001,045,000524,288
5Nov 8, 2026 08:111,26012,227,7032,114,0001,038,000524,288
6Nov 8, 2026 08:111,27712,259,4872,149,0001,045,000524,288
7Nov 8, 2026 08:111,28712,310,1602,171,0001,047,000524,288
8Nov 8, 2026 08:111,30212,370,5612,050,0001,206,000524,288
9Nov 8, 2026 08:111,35412,429,3792,345,0001,041,000524,288