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 4, 2026 18:01Elijah KinElijah KinScore: 3,988Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2026 18:023,93318,981,7066,478,0003,356,0002,117,632
2Jun 4, 2026 18:023,95819,022,7366,497,0003,399,0002,117,632
3Jun 4, 2026 18:023,98120,426,3396,540,0003,413,0002,117,632
4Jun 4, 2026 18:023,98820,531,3476,536,0003,435,0002,117,632
5Jun 4, 2026 18:023,98819,177,8786,547,0003,425,0002,117,632
6Jun 4, 2026 18:024,00026,869,9086,636,0003,365,0002,117,632
7Jun 4, 2026 18:024,09219,423,8766,880,0003,351,0002,117,632
8Jun 4, 2026 18:024,13819,467,1766,823,0003,524,0002,117,632
9Jun 4, 2026 18:024,18019,594,1386,920,0003,530,0002,117,632