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:55Tomislav TunkovicTomislav TunkovicScore: 1,848Success
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:571,78512,862,9543,187,0001,277,000552,960
2Aug 31, 2026 01:571,78512,733,5183,195,0001,269,000552,960
3Aug 31, 2026 01:571,79212,832,4383,187,0001,295,000552,960
4Aug 31, 2026 01:571,80012,800,8533,207,0001,295,000552,960
5Aug 31, 2026 01:571,84812,985,4383,323,0001,298,000552,960
6Aug 31, 2026 01:571,93013,284,5103,596,0001,230,000552,960
7Aug 31, 2026 01:571,97013,295,5103,694,0001,233,000552,960
8Aug 31, 2026 01:571,97820,779,8333,662,0001,283,000552,960
9Aug 31, 2026 01:572,05226,534,8933,834,0001,296,000552,960