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 22, 2026 05:38olliecrowolliecrowScore: 6,607Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 05:396,49335,756,25811,161,0005,073,0002,482,176
2Apr 22, 2026 05:396,50022,883,88813,204,0003,047,0002,355,200
3Apr 22, 2026 05:396,56123,086,93911,277,0005,126,0002,342,912
4Apr 22, 2026 05:396,60423,019,78614,447,0002,063,0002,387,968
5Apr 22, 2026 05:396,60732,208,34513,421,0003,097,0002,469,888
6Apr 22, 2026 05:396,62423,239,27513,457,0003,105,0002,310,144
7Apr 22, 2026 05:396,65531,159,16113,519,0003,119,0002,482,176
8Apr 22, 2026 05:396,91222,923,74613,214,0004,066,0002,465,792
9Apr 22, 2026 05:397,07724,349,62812,490,0005,204,0002,396,160