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 listDec 30, 2025 05:31Josu San MartinJosu San MartinScore: 19,275Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 16:3919,08971,284,25343,662,0004,061,0002,502,656
2Dec 30, 2025 05:3119,15277,093,47741,896,0005,985,0002,519,040
3Jan 1, 2026 16:3919,16973,761,02844,864,0003,058,0002,514,944
4Dec 30, 2025 05:3119,27574,102,53643,169,0005,019,0002,306,048
5Jan 1, 2026 16:3919,32779,868,46343,284,0005,033,0002,498,560
6Dec 30, 2025 05:3119,72581,551,17043,275,0006,038,0002,510,848