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 28, 2026 08:14TudyMTudyMScore: 258,976Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 08:14258,318661,219,116637,798,0007,997,0002,441,216
2Apr 28, 2026 08:14258,483669,647,137641,215,0004,993,0002,293,760
3Apr 28, 2026 08:14258,729663,978,221640,825,0005,998,0002,441,216
4Apr 28, 2026 08:14258,866664,999,983644,167,0003,000,0002,424,832
5Apr 28, 2026 08:14258,976666,912,504640,437,0007,004,0002,433,024
6Apr 28, 2026 08:14259,046665,236,407641,620,0005,996,0002,433,024
7Apr 28, 2026 08:14259,081663,830,909640,707,0006,996,0002,437,120
8Apr 28, 2026 08:14259,204665,680,662643,011,0005,000,0002,441,216
9Apr 28, 2026 08:14259,383667,391,686641,464,0006,994,0002,392,064