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 listJan 1, 2026 23:38Josu San MartinJosu San MartinScore: 11,606Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 03:1111,54758,855,88721,900,0006,968,0002,482,176
2Jan 2, 2026 03:1111,57755,198,70124,950,0003,992,0002,478,080
3Jan 1, 2026 23:3811,58257,477,96223,963,0004,992,0002,482,176
4Jan 1, 2026 23:3811,60661,278,32322,011,0007,003,0002,375,680
5Jan 2, 2026 03:1111,63455,559,44224,071,0005,014,0002,469,888
6Jan 1, 2026 23:3811,66855,945,42327,160,0002,011,0002,465,792