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 17, 2026 14:04olliecrowolliecrowScore: 4,679Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 14:044,42131,794,2207,033,0004,019,0002,482,176
2Apr 17, 2026 14:044,42829,904,1078,052,0003,019,0002,490,368
3Apr 17, 2026 14:044,44228,645,2528,076,0003,028,0002,482,176
4Apr 17, 2026 14:044,67629,912,43410,627,0001,062,0002,494,464
5Apr 17, 2026 14:044,67934,932,33510,634,0001,063,0002,478,080
6Apr 17, 2026 14:044,68436,592,18011,710,00002,379,776
7Apr 17, 2026 14:044,69228,631,40910,665,0001,066,0002,326,528
8Apr 17, 2026 14:044,76034,173,0757,934,0003,967,0002,404,352
9Apr 17, 2026 14:044,77028,909,23310,933,000993,0002,375,680