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:40Andrew TsibinAndrew TsibinScore: 2,043Success
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:412,02514,997,8253,798,0001,266,0002,117,632
2Jul 30, 2026 21:412,02715,165,6233,806,0001,263,0002,117,632
3Jul 30, 2026 21:412,03015,066,6633,819,0001,257,0002,117,632
4Jul 30, 2026 21:412,03115,040,8103,809,0001,269,0002,117,632
5Jul 30, 2026 21:412,04316,292,2393,803,0001,306,0002,117,632
6Jul 30, 2026 21:412,06315,153,4273,859,0001,300,0002,117,632
7Jul 30, 2026 21:412,08915,193,5823,909,0001,315,0002,117,632
8Jul 30, 2026 21:412,10415,219,8143,933,0001,328,0002,117,632
9Jul 30, 2026 21:412,15515,310,3094,058,0001,331,0002,117,632