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 06:23highload-churnerhighload-churnerScore: 1,336Success
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 06:231,13112,008,3321,546,0001,282,000524,288
2Nov 8, 2026 06:231,15911,953,0402,898,0000524,288
3Nov 8, 2026 06:231,16012,019,8911,473,0001,428,000524,288
4Nov 8, 2026 06:231,25312,230,6581,757,0001,376,000524,288
5Nov 8, 2026 06:231,33612,513,7042,124,0001,217,000524,288
6Nov 8, 2026 06:231,34712,429,8862,157,0001,212,000524,288
7Nov 8, 2026 06:231,36312,499,9622,111,0001,298,000524,288
8Nov 8, 2026 06:231,36512,831,1682,357,0001,056,000524,288
9Nov 8, 2026 06:231,37512,482,4132,384,0001,054,000524,288