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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 21:054,00931,279,8838,019,0002,004,0002,387,968
2Apr 28, 2026 21:054,02324,187,5896,035,0004,023,0002,404,352
3Apr 28, 2026 21:054,03624,714,7946,054,0004,036,0002,359,296
4Apr 28, 2026 21:054,04927,403,4837,086,0003,037,0002,404,352
5Apr 28, 2026 21:054,09026,817,7028,181,0002,045,0002,453,504
6Apr 28, 2026 21:054,10032,700,2677,175,0003,075,0002,355,200
7Apr 28, 2026 21:054,10230,213,5357,179,0003,076,0002,400,256
8Apr 28, 2026 21:054,10427,555,4367,183,0003,078,0002,404,352
9Apr 28, 2026 21:054,46728,372,1348,123,0003,046,0002,400,256