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 28, 2026 08:30TudyMTudyMScore: 29,824Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 08:3229,80493,750,88771,491,0003,020,0002,445,312
2Apr 28, 2026 08:3229,80792,663,44271,498,0003,021,0002,404,352
3Apr 28, 2026 08:3229,81594,562,30471,517,0003,021,0002,453,504
4Apr 28, 2026 08:3229,81997,135,97971,527,0003,022,0002,408,448
5Apr 28, 2026 08:3229,82494,461,46171,540,0003,022,0002,461,696
6Apr 28, 2026 08:3229,82794,094,59070,539,0004,030,0002,457,600
7Apr 28, 2026 08:3229,83290,087,80071,557,0003,023,0002,412,544
8Apr 28, 2026 08:3229,84192,140,03770,572,0004,032,0002,527,232
9Apr 28, 2026 08:3229,84692,433,11771,592,0003,025,0002,453,504