Unique strings Sergey Svistunov

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listMay 1, 2026 11:13Pavel SkripkinPavel SkripkinScore: 16,246Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 11:1415,659536,856,121411,823,000104,955,0002,306,048
2May 1, 2026 11:1415,855538,625,806415,381,000107,839,0002,326,528
3May 1, 2026 11:1415,981546,319,556419,525,000107,877,0002,445,312
4May 1, 2026 11:1416,135549,429,919427,582,000104,897,0002,326,528
5May 1, 2026 11:1416,246550,091,164432,095,000104,023,0002,478,080
6May 1, 2026 11:1416,431564,741,692435,180,000107,044,0002,338,816
7May 1, 2026 11:1416,851571,437,658443,078,000113,019,0002,482,176
8May 1, 2026 11:1416,942576,423,865453,092,000106,021,0002,326,528
9May 1, 2026 11:1417,854603,404,912476,351,000112,846,0002,523,136