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 19:05olliecrowolliecrowScore: 5,149Success
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 19:094,93232,325,1499,248,0003,082,0002,252,800
2Apr 20, 2026 19:094,93229,480,63010,277,0002,055,0002,301,952
3Apr 20, 2026 19:094,95333,065,3989,288,0003,096,0002,252,800
4Apr 20, 2026 19:094,98333,220,5458,306,0004,153,0002,273,280
5Apr 20, 2026 19:095,14928,394,40311,883,000990,0002,260,992
6Apr 20, 2026 19:095,15328,589,03210,902,0001,982,0002,265,088
7Apr 20, 2026 19:095,15626,587,2948,924,0003,966,0002,265,088
8Apr 20, 2026 19:095,15934,497,7617,938,0004,961,0002,265,088
9Apr 20, 2026 19:095,39231,348,1479,334,0004,148,0002,297,856