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 09:40highload-churnerhighload-churnerScore: 1,287Success
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 09:401,20612,056,3051,967,0001,048,000524,288
2Nov 8, 2026 09:401,23712,221,4171,692,0001,402,000524,288
3Nov 8, 2026 09:401,25212,158,6431,614,0001,516,000524,288
4Nov 8, 2026 09:401,25912,326,8161,889,0001,260,000524,288
5Nov 8, 2026 09:401,28712,322,9942,172,0001,046,000524,288
6Nov 8, 2026 09:401,28912,296,1782,168,0001,055,000524,288
7Nov 8, 2026 09:401,29512,318,7462,185,0001,054,000524,288
8Nov 8, 2026 09:401,29812,307,7772,203,0001,043,000524,288
9Nov 8, 2026 09:401,30412,351,8612,210,0001,051,000524,288