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 listJul 16, 2026 20:16Andrew TsibinAndrew TsibinScore: 4,329Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 20:174,25620,309,1259,495,0001,145,0002,113,536
2Jul 16, 2026 20:174,30020,348,2189,611,0001,141,0002,113,536
3Jul 16, 2026 20:174,31420,419,6549,667,0001,118,0002,113,536
4Jul 16, 2026 20:174,31420,391,6459,655,0001,132,0002,113,536
5Jul 16, 2026 20:174,32920,509,4199,692,0001,132,0002,113,536
6Jul 16, 2026 20:174,33920,485,4969,703,0001,146,0002,113,536
7Jul 16, 2026 20:174,34020,483,7999,709,0001,142,0002,113,536
8Jul 16, 2026 20:174,34420,519,7379,708,0001,154,0002,113,536
9Jul 16, 2026 20:174,36520,561,2579,724,0001,189,0002,113,536