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 21, 2026 10:42Charles CabergsCharles CabergsScore: 11,312Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 10:4311,12257,672,54719,862,0007,945,0002,453,504
2Apr 21, 2026 10:4311,13151,661,04920,872,0006,957,0002,297,856
3Apr 21, 2026 10:4311,16052,673,40920,925,0006,975,0002,461,696
4Apr 21, 2026 10:4311,21157,521,73019,020,0009,009,0002,371,584
5Apr 21, 2026 10:4311,31244,670,22519,190,0009,090,0002,310,144
6Apr 21, 2026 10:4311,36255,577,92520,291,0008,116,0002,453,504
7Apr 21, 2026 10:4311,41855,644,47520,391,0008,156,0002,449,408
8Apr 21, 2026 10:4311,49956,566,45219,508,0009,241,0002,494,464
9Apr 21, 2026 10:4311,82054,704,16523,437,0006,114,0002,461,696