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 13:50limanjun99limanjun99Score: 3,049Success
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 13:502,99828,222,5456,425,0001,070,0002,527,232
2Apr 13, 2026 13:503,01726,850,7875,387,0002,155,0002,293,760
3Apr 13, 2026 13:503,02728,070,2475,406,0002,162,0002,293,760
4Apr 13, 2026 13:503,04024,711,2025,428,0002,171,0002,269,184
5Apr 13, 2026 13:503,04924,327,2575,445,0002,178,0002,293,760
6Apr 13, 2026 13:503,05823,650,3475,460,0002,184,0002,273,280
7Apr 13, 2026 13:503,06527,997,6386,569,0001,094,0002,293,760
8Apr 13, 2026 13:503,06628,667,1175,476,0002,190,0002,363,392
9Apr 13, 2026 13:503,20026,235,1745,000,0003,000,0002,506,752