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 31, 2025 20:37Павел РатмановПавел РатмановScore: 67,035Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 20:3766,5242,220,712,9512,171,291,00023,992,0002,396,160
2Dec 31, 2025 20:3766,7762,232,601,4462,181,631,00021,986,0002,408,448
3Dec 31, 2025 20:3766,8832,239,927,9972,183,143,00023,990,0002,281,472
4Dec 31, 2025 20:3767,0272,241,386,8662,186,897,00024,987,0002,293,760
5Dec 31, 2025 20:3767,0352,241,639,0952,191,149,00020,991,0002,506,752
6Dec 31, 2025 20:3767,0822,248,714,4702,192,718,00020,987,0002,478,080
7Dec 31, 2025 20:3767,3172,257,168,0422,200,475,00020,985,0002,420,736
8Dec 31, 2025 20:3767,5452,256,862,4302,204,989,00023,989,0002,510,848
9Dec 31, 2025 20:3768,6362,293,422,2502,243,010,00021,990,0002,281,472