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 listMay 18, 2026 17:01Jacob McDanielJacob McDanielScore: 3,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 17:023,00419,729,9066,307,0001,205,0002,117,632
2May 18, 2026 17:023,00918,566,3266,310,0001,213,0002,117,632
3May 18, 2026 17:023,01816,675,2156,320,0001,227,0002,117,632
4May 18, 2026 17:023,03417,182,4376,392,0001,193,0002,117,632
5May 18, 2026 17:023,05116,829,2226,466,0001,162,0002,117,632
6May 18, 2026 17:023,05716,894,3196,371,0001,273,0002,113,536
7May 18, 2026 17:023,05818,749,0616,440,0001,206,0002,117,632
8May 18, 2026 17:023,08618,895,3866,499,0001,216,0002,117,632
9May 18, 2026 17:023,14328,924,8536,652,0001,206,0002,117,632