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 listApr 29, 2026 22:04olliecrowolliecrowScore: 3,899Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 22:073,69726,907,7837,190,0002,054,0002,338,816
2Apr 29, 2026 22:073,77823,633,8508,397,0001,049,0002,461,696
3Apr 29, 2026 22:073,81629,718,4626,360,0003,180,0002,396,160
4Apr 29, 2026 22:073,85925,189,7228,577,0001,072,0002,457,600
5Apr 29, 2026 22:073,89926,186,5908,665,0001,083,0002,387,968
6Apr 29, 2026 22:073,94022,720,6275,910,0003,940,0002,473,984
7Apr 29, 2026 22:073,96731,477,3155,951,0003,967,0002,387,968
8Apr 29, 2026 22:074,00426,034,8807,007,0003,003,0002,396,160
9Apr 29, 2026 22:074,02227,153,3388,045,0002,011,0002,392,064