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:10olliecrowolliecrowScore: 6,430Success
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:126,33437,206,82313,858,0001,979,0002,310,144
2Apr 20, 2026 16:126,34436,949,01212,888,0002,974,0002,265,088
3Apr 20, 2026 16:126,35334,726,53412,906,0002,978,0002,265,088
4Apr 20, 2026 16:126,41131,640,60612,021,0004,007,0002,265,088
5Apr 20, 2026 16:126,43038,689,19112,058,0004,019,0002,269,184
6Apr 20, 2026 16:126,52041,204,31313,246,0003,056,0002,265,088
7Apr 20, 2026 16:126,58043,258,27613,366,0003,084,0002,306,048
8Apr 20, 2026 16:126,61536,160,91512,404,0004,134,0002,260,992
9Apr 20, 2026 16:126,75544,315,69913,908,0002,980,0002,277,376