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 listDec 7, 2025 10:19Rajarshi BasuRajarshi BasuScore: 320,371Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 7, 2025 10:19318,33210,536,247,78410,460,969,00043,974,0002,400,256
2Dec 7, 2025 10:19318,78310,558,033,04210,486,878,00032,977,0002,334,720
3Dec 7, 2025 10:19319,30910,571,333,22010,495,230,00041,976,0002,387,968
4Dec 7, 2025 10:19319,40810,578,632,07810,511,480,00028,982,0002,433,024
5Dec 7, 2025 10:19320,37110,602,884,27310,535,267,00036,976,0002,510,848
6Dec 7, 2025 10:19320,40210,607,485,75810,533,297,00039,982,0002,506,752
7Dec 7, 2025 10:19320,76410,617,823,27110,552,230,00032,981,0002,277,376
8Dec 7, 2025 10:19321,82510,655,106,25010,580,241,00039,974,0002,351,104
9Dec 7, 2025 10:19322,53310,674,832,57210,599,628,00043,969,0002,285,568