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 21, 2026 09:16Dominique GarmierDominique GarmierScore: 8,397Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 09:168,28239,770,35616,564,0004,141,0002,510,848
2Apr 21, 2026 09:168,35141,252,50014,914,0005,965,0002,265,088
3Apr 21, 2026 09:168,38243,138,20913,970,0006,985,0002,285,568
4Apr 21, 2026 09:168,38240,473,91815,966,0004,989,0002,367,488
5Apr 21, 2026 09:168,39734,605,19613,996,0006,998,0002,297,856
6Apr 21, 2026 09:168,47647,558,41718,165,0003,027,0002,506,752
7Apr 21, 2026 09:168,49145,611,21414,153,0007,076,0002,265,088
8Apr 21, 2026 09:168,52347,512,83115,220,0006,088,0002,510,848
9Apr 21, 2026 09:168,53942,585,81916,266,0005,083,0002,506,752