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 listJun 3, 2026 07:42Elijah KinElijah KinScore: 5,219Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 07:444,77020,892,7319,703,0002,224,0002,113,536
2Jun 3, 2026 07:444,83621,071,6648,971,0003,121,0002,117,632
3Jun 3, 2026 07:444,84021,074,0688,970,0003,131,0002,113,536
4Jun 3, 2026 07:445,19521,949,02210,767,0002,221,0002,113,536
5Jun 3, 2026 07:445,21922,078,85310,843,0002,206,0002,113,536
6Jun 3, 2026 07:445,36922,369,63811,223,0002,201,0002,113,536
7Jun 3, 2026 07:445,44822,622,54710,520,0003,100,0002,113,536
8Jun 3, 2026 07:445,45322,654,52210,541,0003,092,0002,113,536
9Jun 3, 2026 07:445,47724,345,27510,603,0003,091,0002,117,632