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 9, 2026 23:37Victor MerckléVictor MerckléScore: 4,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 23:404,08919,172,4377,428,0002,796,0002,138,112
2Jun 9, 2026 23:404,24419,501,3817,526,0003,086,0002,129,920
3Jun 9, 2026 23:404,31319,671,3227,423,0003,360,0002,129,920
4Jun 9, 2026 23:404,32519,856,7087,458,0003,356,0002,138,112
5Jun 9, 2026 23:404,33519,775,8307,445,0003,394,0002,138,112
6Jun 9, 2026 23:404,34519,736,2787,463,0003,400,0002,129,920
7Jun 9, 2026 23:404,38019,846,2827,542,0003,408,0002,129,920
8Jun 9, 2026 23:404,38519,860,6397,596,0003,367,0002,138,112
9Jun 9, 2026 23:404,42019,916,0347,628,0003,423,0002,138,112