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 listFeb 5, 2026 03:38Josu San MartinJosu San MartinScore: 7,726Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 03:387,65247,531,49417,117,0002,013,0002,334,720
2Feb 5, 2026 03:387,66144,877,99617,137,0002,016,0002,498,560
3Feb 5, 2026 03:387,70049,854,74817,223,0002,026,0002,502,656
4Feb 5, 2026 03:387,71639,043,19715,229,0004,061,0002,498,560
5Feb 5, 2026 03:387,72645,080,52615,248,0004,066,0002,498,560
6Feb 5, 2026 03:387,77444,830,64115,344,0004,091,0002,301,952
7Feb 5, 2026 03:387,81746,500,25616,457,0003,085,0002,510,848
8Feb 5, 2026 03:387,82838,505,77913,391,0006,180,0002,273,280
9Feb 5, 2026 03:387,91444,373,83214,578,0005,206,0002,506,752