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 16:58Josu San MartinJosu San MartinScore: 2,803Success
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 17:002,79215,615,9415,873,0001,108,0002,117,632
2Sep 15, 2026 17:002,79915,657,6305,890,0001,108,0002,117,632
3Sep 15, 2026 17:002,79915,662,3815,888,0001,110,0002,117,632
4Sep 15, 2026 17:002,80015,628,1345,893,0001,109,0002,117,632
5Sep 15, 2026 17:002,80315,636,6025,900,0001,109,0002,117,632
6Sep 15, 2026 17:002,81015,666,4235,915,0001,110,0002,117,632
7Sep 15, 2026 17:002,81115,675,8215,919,0001,109,0002,117,632
8Sep 15, 2026 17:002,81515,760,5465,924,0001,114,0002,117,632
9Sep 15, 2026 17:003,05216,295,5346,534,0001,098,0002,117,632