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 29, 2026 05:18olliecrowolliecrowScore: 4,034Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 05:203,96024,880,7167,920,0001,980,0002,396,160
2Apr 29, 2026 05:204,01627,192,9197,029,0003,012,0002,539,520
3Apr 29, 2026 05:204,02429,337,4308,050,0002,012,0002,396,160
4Apr 29, 2026 05:204,02924,231,3737,052,0003,022,0002,404,352
5Apr 29, 2026 05:204,03425,583,7958,069,0002,017,0002,535,424
6Apr 29, 2026 05:204,03632,515,1446,055,0004,037,0002,392,064
7Apr 29, 2026 05:204,04426,774,2958,988,0001,123,0002,396,160
8Apr 29, 2026 05:204,07223,859,4777,919,0002,262,0002,400,256
9Apr 29, 2026 05:204,13032,278,4718,260,0002,065,0002,396,160