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 listJul 6, 2025 18:43T PrathamT PrathamScore: 411,374Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2025 18:43411,1251,057,082,3231,015,816,00011,997,0002,506,752
2Jul 6, 2025 18:43411,1391,059,724,1511,018,850,0008,998,0002,506,752
3Jul 6, 2025 18:43411,1741,056,075,9961,018,935,0008,999,0002,506,752
4Jul 6, 2025 18:43411,3171,054,863,7161,018,299,0009,993,0002,494,464
5Jul 6, 2025 18:43411,3741,057,791,5351,020,440,0007,995,0002,297,856
6Jul 6, 2025 18:43411,4321,054,959,6681,017,585,00010,995,0002,494,464
7Jul 6, 2025 18:43411,5481,054,803,8781,018,872,0009,998,0002,506,752
8Jul 6, 2025 18:43411,6691,054,594,1321,017,171,00012,002,0002,498,560
9Jul 6, 2025 18:43411,7201,054,042,9051,018,308,00010,992,0002,473,984