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 30, 2026 21:35Andrew TsibinAndrew TsibinScore: 2,097Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 21:352,07715,229,5503,947,0001,246,0002,117,632
2Jul 30, 2026 21:352,08515,257,6093,939,0001,275,0002,117,632
3Jul 30, 2026 21:352,08515,240,5193,943,0001,271,0002,117,632
4Jul 30, 2026 21:352,09315,286,0303,962,0001,272,0002,117,632
5Jul 30, 2026 21:352,09715,309,6463,956,0001,287,0002,117,632
6Jul 30, 2026 21:352,10515,212,6273,976,0001,288,0002,117,632
7Jul 30, 2026 21:352,12715,385,8294,000,0001,319,0002,117,632
8Jul 30, 2026 21:352,13615,321,1874,038,0001,304,0002,117,632
9Jul 30, 2026 21:352,16015,321,7984,080,0001,320,0002,117,632