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 19, 2026 01:00Charles CabergsCharles CabergsScore: 12,755Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 01:0012,58258,812,23919,278,00012,176,0002,510,848
2Apr 19, 2026 01:0012,61456,999,23625,432,0006,103,0002,285,568
3Apr 19, 2026 01:0012,68158,109,67220,453,00011,249,0002,494,464
4Apr 19, 2026 01:0012,73759,452,91721,892,0009,951,0002,510,848
5Apr 19, 2026 01:0012,75555,519,26126,905,0004,982,0002,445,312
6Apr 19, 2026 01:0012,78458,302,79921,973,0009,987,0002,457,600
7Apr 19, 2026 01:0012,86256,761,94420,097,00012,058,0002,461,696
8Apr 19, 2026 01:0013,03161,439,57223,415,0009,162,0002,457,600
9Apr 19, 2026 01:0013,03758,414,16520,370,00012,222,0002,285,568