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 21, 2026 09:51Dominique GarmierDominique GarmierScore: 15,866Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 09:5115,79263,593,09436,445,0003,037,0002,510,848
2Apr 21, 2026 09:5115,81561,563,98235,483,0004,055,0002,256,896
3Apr 21, 2026 09:5115,82862,517,69136,528,0003,044,0002,260,992
4Apr 21, 2026 09:5115,83664,262,45533,501,0006,091,0002,256,896
5Apr 21, 2026 09:5115,86670,511,47835,599,0004,068,0002,473,984
6Apr 21, 2026 09:5115,86769,936,42735,601,0004,068,0002,256,896
7Apr 21, 2026 09:5115,91470,581,49634,812,0004,973,0002,510,848
8Apr 21, 2026 09:5115,94065,465,31336,862,0002,988,0002,252,800
9Apr 21, 2026 09:5116,06053,583,79336,136,0004,015,0002,392,064