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 27, 2026 16:11Charles CabergsCharles CabergsScore: 6,315Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 16:116,28236,877,85011,517,0004,188,0002,461,696
2Apr 27, 2026 16:116,30430,842,69210,837,0004,925,0002,535,424
3Apr 27, 2026 16:116,30837,023,3369,857,0005,914,0002,465,792
4Apr 27, 2026 16:116,30838,299,12310,843,0004,929,0002,469,888
5Apr 27, 2026 16:116,31532,803,1369,868,0005,920,0002,473,984
6Apr 27, 2026 16:116,32831,399,34311,865,0003,955,0002,473,984
7Apr 27, 2026 16:116,36732,896,03413,929,0001,989,0002,371,584
8Apr 27, 2026 16:116,50037,718,31513,205,0003,047,0002,461,696
9Apr 27, 2026 16:116,51336,761,92413,230,0003,053,0002,461,696