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 listSep 15, 2026 21:03Josu San MartinJosu San MartinScore: 2,759Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 21:032,75115,835,4335,771,0001,108,0002,117,632
2Sep 15, 2026 21:032,75115,555,9425,773,0001,106,0002,117,632
3Sep 15, 2026 21:032,75615,598,6295,782,0001,108,0002,117,632
4Sep 15, 2026 21:032,75815,642,4945,788,0001,108,0002,117,632
5Sep 15, 2026 21:032,75915,589,8245,789,0001,109,0002,117,632
6Sep 15, 2026 21:032,76415,596,9355,800,0001,110,0002,117,632
7Sep 15, 2026 21:032,76415,571,3395,801,0001,109,0002,117,632
8Sep 15, 2026 21:032,77015,474,7075,814,0001,112,0002,117,632
9Sep 15, 2026 21:032,85015,790,9755,997,0001,129,0002,117,632