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 listFeb 6, 2026 04:41Josu San MartinJosu San MartinScore: 4,598Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2026 04:414,55630,374,6748,283,0003,106,0002,404,352
2Feb 6, 2026 04:414,56624,962,0058,303,0003,113,0002,408,448
3Feb 6, 2026 04:414,56925,455,9468,308,0003,115,0002,400,256
4Feb 6, 2026 04:414,57631,151,9777,281,0004,160,0002,498,560
5Feb 6, 2026 04:414,58126,567,4778,329,0003,123,0002,297,856
6Feb 6, 2026 04:414,59123,638,0278,347,0003,130,0002,519,040
7Feb 6, 2026 04:414,59827,432,2758,360,0003,135,0002,412,544
8Feb 6, 2026 04:414,61228,257,2867,338,0004,193,0002,301,952
9Feb 6, 2026 04:414,68326,251,45210,643,0001,064,0002,412,544
10Feb 6, 2026 04:414,71231,246,2457,496,0004,283,0002,408,448
11Feb 6, 2026 04:414,76233,625,2707,937,0003,968,0002,363,392
12Feb 6, 2026 04:414,76727,856,3698,938,0002,979,0002,306,048