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 12, 2026 15:19limanjun99limanjun99Score: 12,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 15:1912,71659,667,13319,868,00011,921,0002,449,408
2Apr 12, 2026 15:1912,75358,306,39821,919,0009,963,0002,445,312
3Apr 12, 2026 15:1912,77365,534,75017,962,00013,970,0002,437,120
4Apr 12, 2026 15:1912,79263,653,39321,987,0009,994,0002,269,184
5Apr 12, 2026 15:1912,92259,279,85325,238,0007,066,0002,449,408
6Apr 12, 2026 15:1912,93659,269,37723,245,0009,096,0002,326,528
7Apr 12, 2026 15:1913,06460,859,66820,412,00012,247,0002,281,472
8Apr 12, 2026 15:1913,15061,263,05022,913,0009,962,0002,277,376
9Apr 12, 2026 15:1913,27366,787,57020,111,00013,072,0002,359,296