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 13, 2026 04:54limanjun99limanjun99Score: 4,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 04:544,26427,371,7448,529,0002,132,0002,506,752
2Apr 13, 2026 04:544,28327,102,6788,567,0002,141,0002,510,848
3Apr 13, 2026 04:544,29528,546,4738,591,0002,147,0002,506,752
4Apr 13, 2026 04:544,30430,241,2057,532,0003,228,0002,510,848
5Apr 13, 2026 04:544,31026,552,1878,620,0002,155,0002,510,848
6Apr 13, 2026 04:544,35026,333,4747,909,0002,966,0002,334,720
7Apr 13, 2026 04:544,37125,900,2897,948,0002,980,0002,510,848
8Apr 13, 2026 04:544,39632,383,8485,995,0004,996,0002,289,664
9Apr 13, 2026 04:544,41428,851,6167,022,0004,012,0002,293,760