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:42Josu San MartinJosu San MartinScore: 4,619Success
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:424,54130,738,5468,257,0003,096,0002,301,952
2Feb 6, 2026 04:424,56225,307,0047,257,0004,147,0002,502,656
3Feb 6, 2026 04:424,56430,217,0879,336,0002,074,0002,420,736
4Feb 6, 2026 04:424,58527,038,5878,336,0003,126,0002,301,952
5Feb 6, 2026 04:424,58625,890,8718,338,0003,126,0002,297,856
6Feb 6, 2026 04:424,58926,022,7409,387,0002,086,0002,334,720
7Feb 6, 2026 04:424,61226,254,2398,385,0003,144,0002,404,352
8Feb 6, 2026 04:424,61932,458,3447,349,0004,199,0002,404,352
9Feb 6, 2026 04:424,65127,424,7959,514,0002,114,0002,396,160
10Feb 6, 2026 04:424,68224,716,68610,641,0001,064,0002,301,952
11Feb 6, 2026 04:424,75027,952,0887,917,0003,958,0002,351,104
12Feb 6, 2026 04:424,76029,297,5748,926,0002,975,0002,375,680
13Feb 6, 2026 04:424,76327,866,4599,924,0001,984,0002,301,952
14Feb 6, 2026 04:424,77828,551,4838,958,0002,986,0002,301,952
15Feb 6, 2026 04:424,78233,705,2937,970,0003,985,0002,408,448