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 listJan 16, 2026 03:48Josu San MartinJosu San MartinScore: 8,694Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2026 03:488,65045,744,98917,506,0004,119,0002,502,656
2Jan 16, 2026 03:488,65852,788,53518,554,0003,092,0002,273,280
3Jan 16, 2026 03:488,66349,795,04417,533,0004,125,0002,506,752
4Jan 16, 2026 03:488,66648,149,77917,538,0004,126,0002,351,104
5Jan 16, 2026 03:488,69448,261,50518,631,0003,105,0002,514,944
6Jan 16, 2026 03:488,78651,792,97816,973,0004,992,0002,506,752
7Jan 16, 2026 03:488,80947,571,35817,017,0005,005,0002,510,848
8Jan 16, 2026 03:488,93846,541,01218,282,0004,062,0002,498,560
9Jan 16, 2026 03:488,98652,626,23719,401,0003,063,0002,273,280