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 18, 2026 04:57Charles CabergsCharles CabergsScore: 16,380Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 04:5716,27467,546,82135,600,0005,085,0002,510,848
2Apr 18, 2026 04:5716,34566,231,62935,879,0004,983,0002,523,136
3Apr 18, 2026 04:5716,34763,959,94533,890,0006,977,0002,510,848
4Apr 18, 2026 04:5716,34867,561,27732,896,0007,974,0002,514,944
5Apr 18, 2026 04:5716,38064,858,95635,956,0004,994,0002,514,944
6Apr 18, 2026 04:5716,48567,707,31234,176,0007,036,0002,281,472
7Apr 18, 2026 04:5716,48670,040,44532,168,0009,047,0002,482,176
8Apr 18, 2026 04:5716,49773,026,20833,195,0008,047,0002,514,944
9Apr 18, 2026 04:5716,51870,601,14433,237,0008,057,0002,281,472