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 00:42Tomislav TunkovicTomislav TunkovicScore: 1,517Success
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 00:481,38411,626,8553,461,0000524,288
2Aug 31, 2026 00:481,39013,204,8383,475,0000524,288
3Aug 31, 2026 00:481,48411,905,8003,710,0000524,288
4Aug 31, 2026 00:481,51611,908,4533,792,0000524,288
5Aug 31, 2026 00:481,51711,988,7183,793,0000524,288
6Aug 31, 2026 00:481,53111,948,6163,828,0000524,288
7Aug 31, 2026 00:481,53312,014,7353,833,0000524,288
8Aug 31, 2026 00:481,53511,982,9363,839,0000524,288
9Aug 31, 2026 00:481,53812,001,1143,847,0000524,288