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 20, 2026 16:47BenBenScore: 28,566Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 16:5127,92098,126,58562,822,0006,980,0002,265,088
2Apr 20, 2026 16:5128,20293,625,54463,457,0007,050,0002,252,800
3Apr 20, 2026 16:5128,34892,610,03460,890,0009,982,0002,265,088
4Apr 20, 2026 16:5128,56097,927,51761,345,00010,056,0002,256,896
5Apr 20, 2026 16:5128,56684,669,82560,353,00011,064,0002,326,528
6Apr 20, 2026 16:5128,842100,498,68663,092,0009,013,0002,252,800
7Apr 20, 2026 16:5128,88097,829,35163,175,0009,025,0002,273,280
8Apr 20, 2026 16:5129,17695,651,14363,949,0008,992,0002,273,280
9Apr 20, 2026 16:5130,40890,463,99065,018,00011,003,0002,277,376