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 26, 2026 17:34TudyMTudyMScore: 601,531Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 17:34601,4281,520,057,0921,501,573,0001,999,0002,551,808
2Apr 26, 2026 17:34601,4541,522,826,2251,502,636,000999,0002,322,432
3Apr 26, 2026 17:34601,4631,523,231,3481,501,660,0001,999,0002,297,856
4Apr 26, 2026 17:34601,4841,526,111,1341,501,713,0001,999,0002,555,904
5Apr 26, 2026 17:34601,5311,523,918,2631,501,831,0001,998,0002,560,000
6Apr 26, 2026 17:34601,5371,521,590,4851,501,844,0001,999,0002,555,904
7Apr 26, 2026 17:34601,5541,519,711,3751,501,888,0001,999,0002,318,336
8Apr 26, 2026 17:34601,5601,520,476,3511,500,903,0002,997,0002,555,904
9Apr 26, 2026 17:34601,5641,522,500,4281,501,913,0001,998,0002,330,624