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:56highload-churnerhighload-churnerScore: 1,321Success
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:561,27512,358,6961,978,0001,210,000524,288
2Nov 8, 2026 08:561,30512,430,1112,077,0001,186,000524,288
3Nov 8, 2026 08:561,31212,823,4652,059,0001,222,000524,288
4Nov 8, 2026 08:561,31812,513,0132,044,0001,251,000524,288
5Nov 8, 2026 08:561,32112,370,1672,093,0001,210,000524,288
6Nov 8, 2026 08:561,32612,766,2332,277,0001,039,000524,288
7Nov 8, 2026 08:561,32812,403,4342,088,0001,232,000524,288
8Nov 8, 2026 08:561,34212,476,7932,320,0001,035,000524,288
9Nov 8, 2026 08:561,39712,876,5872,141,0001,352,000524,288