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:32highload-churnerhighload-churnerScore: 1,240Success
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:321,14411,950,4281,835,0001,025,000524,288
2Nov 8, 2026 08:321,15012,006,5841,849,0001,028,000524,288
3Nov 8, 2026 08:321,15112,046,2271,847,0001,031,000524,288
4Nov 8, 2026 08:321,15211,884,8891,440,0001,441,000524,288
5Nov 8, 2026 08:321,24012,252,9272,063,0001,038,000524,288
6Nov 8, 2026 08:321,26312,284,6111,751,0001,408,000524,288
7Nov 8, 2026 08:321,27412,190,4382,124,0001,062,000524,288
8Nov 8, 2026 08:321,27812,259,1332,138,0001,058,000524,288
9Nov 8, 2026 08:321,28612,655,4502,149,0001,066,000524,288