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 listAug 31, 2026 01:06Tomislav TunkovicTomislav TunkovicScore: 1,536Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 01:201,43011,750,5453,576,0000524,288
2Aug 31, 2026 01:201,47411,796,9923,687,0000524,288
3Aug 31, 2026 01:201,49411,848,8183,735,0000524,288
4Aug 31, 2026 01:201,52211,911,3603,806,0000524,288
5Aug 31, 2026 01:201,53611,991,3843,840,0000524,288
6Aug 31, 2026 01:201,53812,026,1543,845,0000524,288
7Aug 31, 2026 01:201,54112,066,1453,853,0000524,288
8Aug 31, 2026 01:201,54513,309,2163,863,0000524,288
9Aug 31, 2026 01:201,54611,965,4593,866,0000524,288