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 listJan 16, 2026 03:27Josu San MartinJosu San MartinScore: 9,990Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2026 03:279,97757,363,25018,956,0005,986,0002,347,008
2Jan 16, 2026 03:279,99043,042,66117,983,0006,993,0002,502,656
3Jan 16, 2026 03:2710,02454,500,76618,044,0007,017,0002,502,656