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 21, 2026 03:15olliecrowolliecrowScore: 4,938Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 03:174,75726,886,5649,912,0001,982,0002,383,872
2Apr 21, 2026 03:174,80934,940,9499,018,0003,006,0002,392,064
3Apr 21, 2026 03:174,89628,110,32210,202,0002,040,0002,387,968
4Apr 21, 2026 03:174,93627,300,91710,285,0002,057,0002,387,968
5Apr 21, 2026 03:174,93831,074,62210,288,0002,057,0002,383,872
6Apr 21, 2026 03:175,00228,475,96810,421,0002,084,0002,392,064
7Apr 21, 2026 03:175,04131,448,20011,554,0001,050,0002,297,856
8Apr 21, 2026 03:175,18532,323,72311,967,000997,0002,301,952
9Apr 21, 2026 03:175,21025,957,12510,021,0003,006,0002,387,968