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 listJun 1, 2026 10:16Victor MerckléVictor MerckléScore: 2,528Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 10:172,50413,834,9164,944,0001,318,0002,113,536
2Jun 1, 2026 10:172,51213,846,6484,958,0001,322,0002,113,536
3Jun 1, 2026 10:172,51713,816,7054,966,0001,327,0002,113,536
4Jun 1, 2026 10:172,52513,917,3534,987,0001,326,0002,113,536
5Jun 1, 2026 10:172,52813,878,7164,995,0001,325,0002,113,536
6Jun 1, 2026 10:172,57713,994,1075,114,0001,329,0002,113,536
7Jun 1, 2026 10:172,60614,019,1055,195,0001,321,0002,113,536
8Jun 1, 2026 10:172,62014,091,7345,227,0001,323,0002,113,536
9Jun 1, 2026 10:172,63214,151,8025,255,0001,326,0002,113,536