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 10, 2025 03:23nnScore: 210,733Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2025 03:23210,3266,968,418,0556,901,794,00038,976,0002,408,448
2May 10, 2025 03:23210,5136,981,653,1526,892,954,00053,968,0002,453,504
3May 10, 2025 03:23210,5666,981,273,2876,912,691,00035,977,0002,371,584
4May 10, 2025 03:23210,6686,986,126,8796,909,063,00042,975,0002,363,392
5May 10, 2025 03:23210,7336,988,281,9066,907,229,00046,974,0002,277,376
6May 10, 2025 03:23210,8036,985,556,8166,910,545,00045,970,0002,486,272
7May 10, 2025 03:23211,3557,007,326,7536,910,753,00063,960,0002,371,584
8May 10, 2025 03:23213,1177,068,025,3866,979,896,00052,968,0002,428,928
9May 10, 2025 03:23220,3767,310,359,9307,230,447,00041,973,0002,408,448