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 19, 2025 19:36Josu San MartinJosu San MartinScore: 62,193Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 19:3661,7032,061,723,7632,005,212,00030,987,0002,486,272
2Dec 19, 2025 19:3661,8772,073,671,6462,011,943,00029,984,0002,490,368
3Dec 19, 2025 19:3662,0422,074,942,9152,017,388,00029,990,0002,420,736
4Dec 19, 2025 19:3662,1772,075,024,0602,017,873,00033,981,0002,281,472
5Dec 19, 2025 19:3662,1932,080,649,0412,022,379,00029,975,0002,281,472
6Dec 19, 2025 19:3663,3542,119,816,1942,057,699,00032,979,0002,482,176
7Dec 19, 2025 19:3663,3842,126,832,0542,059,691,00031,979,0002,478,080
8Dec 19, 2025 19:3663,4082,116,827,5982,060,493,00031,976,0002,482,176
9Dec 19, 2025 19:3663,8762,137,153,4562,073,922,00033,982,0002,281,472