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:39highload-churnerhighload-churnerScore: 1,289Success
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:401,15411,966,7681,557,0001,328,000524,288
2Nov 8, 2026 08:401,26112,257,4561,930,0001,224,000524,288
3Nov 8, 2026 08:401,27012,200,2231,951,0001,225,000524,288
4Nov 8, 2026 08:401,27112,285,2381,988,0001,190,000524,288
5Nov 8, 2026 08:401,28912,418,7241,914,0001,309,000524,288
6Nov 8, 2026 08:401,30212,469,0561,913,0001,343,000524,288
7Nov 8, 2026 08:401,31712,298,3462,038,0001,256,000524,288
8Nov 8, 2026 08:401,34412,356,0851,899,0001,462,000524,288
9Nov 8, 2026 08:401,34612,428,6062,119,0001,247,000524,288