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 listMar 16, 2026 14:21Dominique GarmierDominique GarmierScore: 15,894Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 13:1415,80569,667,54436,473,0003,039,0002,494,464
2Mar 16, 2026 13:1415,80666,073,98234,449,0005,066,0002,277,376
3Mar 16, 2026 14:2115,84063,810,76635,540,0004,061,0002,457,600
4Mar 16, 2026 13:1415,89465,743,89735,661,0004,075,0002,342,912
5Mar 16, 2026 14:2115,95264,833,24534,895,0004,985,0002,281,472
6Mar 16, 2026 14:2116,03262,913,93535,071,0005,010,0002,314,240