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 29, 2026 17:23Charles CabergsCharles CabergsScore: 5,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 17:295,70832,867,7408,155,0006,116,0002,437,120
2Apr 29, 2026 17:295,77030,768,4729,275,0005,152,0002,453,504
3Apr 29, 2026 17:295,78634,256,75210,333,0004,133,0002,449,408
4Apr 29, 2026 17:295,80732,016,56210,370,0004,148,0002,457,600
5Apr 29, 2026 17:295,86029,046,97511,512,0003,139,0002,457,600
6Apr 29, 2026 17:295,88234,273,5079,455,0005,252,0002,465,792
7Apr 29, 2026 17:295,93237,284,27810,876,0003,955,0002,453,504
8Apr 29, 2026 17:295,94235,975,31911,672,0003,183,0002,453,504
9Apr 29, 2026 17:295,98432,645,70611,968,0002,992,0002,453,504