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 listJul 30, 2026 21:32Andrew TsibinAndrew TsibinScore: 484,326Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 21:32479,4821,208,685,3511,197,373,0001,333,0002,113,536
2Jul 30, 2026 21:32481,0021,212,585,2421,201,179,0001,328,0002,113,536
3Jul 30, 2026 21:32482,2861,216,003,2941,203,224,0002,491,0002,113,536
4Jul 30, 2026 21:32482,6321,216,641,6411,205,329,0001,253,0002,113,536
5Jul 30, 2026 21:32484,3261,222,862,5931,209,551,0001,265,0002,113,536
6Jul 30, 2026 21:32484,6241,221,497,7081,210,286,0001,276,0002,113,536
7Jul 30, 2026 21:32484,9491,222,269,7661,211,030,0001,343,0002,113,536
8Jul 30, 2026 21:32485,4411,223,577,9391,212,282,0001,322,0002,113,536
9Jul 30, 2026 21:32486,0681,225,161,1051,213,876,0001,294,0002,113,536