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 6, 2026 06:02Josu San MartinJosu San MartinScore: 2,992Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2026 06:022,90924,389,0044,156,0003,117,0002,281,472
2Feb 6, 2026 06:022,92023,687,0043,128,0004,171,0002,424,832
3Feb 6, 2026 06:022,92020,829,3514,171,0003,128,0002,301,952
4Feb 6, 2026 06:022,93928,841,6406,299,0001,049,0002,420,736
5Feb 6, 2026 06:022,94622,404,6834,209,0003,157,0002,297,856
6Feb 6, 2026 06:022,95025,290,0275,268,0002,107,0002,301,952
7Feb 6, 2026 06:022,95123,134,0385,270,0002,108,0002,301,952
8Feb 6, 2026 06:022,97425,688,0974,248,0003,186,0002,428,928
9Feb 6, 2026 06:022,98123,079,1543,194,0004,259,0002,301,952
10Feb 6, 2026 06:022,99224,508,9314,275,0003,206,0002,424,832
11Feb 6, 2026 06:023,01821,299,9376,468,0001,078,0002,420,736
12Feb 6, 2026 06:023,02326,477,0396,478,0001,079,0002,301,952
13Feb 6, 2026 06:023,03822,339,7636,510,0001,085,0002,420,736
14Feb 6, 2026 06:023,04423,978,0097,609,00002,420,736
15Feb 6, 2026 06:023,04625,724,5265,439,0002,175,0002,301,952
16Feb 6, 2026 06:023,04623,323,2215,440,0002,176,0002,424,832
17Feb 6, 2026 06:023,04726,764,6265,442,0002,176,0002,428,928
18Feb 6, 2026 06:023,19524,044,6924,992,0002,995,0002,416,640