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 15:58olliecrowolliecrowScore: 4,507Success
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 16:004,40028,938,3697,000,0004,000,0002,400,256
2Apr 22, 2026 16:004,43529,465,4578,065,0003,024,0002,482,176
3Apr 22, 2026 16:004,45728,186,1208,104,0003,039,0002,396,160
4Apr 22, 2026 16:004,50628,933,87310,243,0001,024,0002,396,160
5Apr 22, 2026 16:004,50730,010,6868,195,0003,073,0002,392,064
6Apr 22, 2026 16:004,54231,190,4649,292,0002,064,0002,531,328
7Apr 22, 2026 16:004,67029,111,4369,553,0002,123,0002,392,064
8Apr 22, 2026 16:004,71233,141,23810,710,0001,071,0002,351,104
9Apr 22, 2026 16:004,77227,283,3189,943,0001,988,0002,387,968