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 22, 2025 03:56Josu San MartinJosu San MartinScore: 30,375Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 03:5630,1731,022,578,055977,705,00017,994,0002,289,664
2Dec 22, 2025 03:5630,2191,023,621,662981,242,00015,987,0002,277,376
3Dec 22, 2025 03:5630,3211,025,119,793985,615,00014,994,0002,289,664
4Dec 22, 2025 03:5630,3281,033,541,853987,834,00012,997,0002,428,928
5Dec 22, 2025 03:5630,3751,032,517,328981,389,00020,986,0002,297,856
6Dec 22, 2025 03:5630,5381,032,539,508990,745,00016,995,0002,453,504
7Dec 22, 2025 03:5630,8671,041,978,3991,005,628,00012,995,0002,297,856
8Dec 22, 2025 03:5631,5351,072,537,9101,024,687,00015,979,0002,297,856
9Dec 22, 2025 03:5631,5631,076,052,0281,023,618,00017,975,0002,416,640