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 28, 2025 14:23zypehzypehScore: 47,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2025 14:2347,3011,589,054,5021,528,942,00031,977,0002,297,856
2Dec 28, 2025 14:2347,3681,595,923,6031,531,146,00031,982,0002,494,464
3Dec 28, 2025 14:2347,4141,592,535,4881,531,685,00032,993,0002,498,560
4Dec 28, 2025 14:2347,4711,591,253,6691,533,566,00032,990,0002,314,240
5Dec 28, 2025 14:2347,6241,599,337,8491,537,604,00033,991,0002,494,464
6Dec 28, 2025 14:2347,6791,605,552,1551,546,431,00026,990,0002,379,776
7Dec 28, 2025 14:2347,7251,605,611,9681,548,950,00025,982,0002,347,008
8Dec 28, 2025 14:2347,7521,607,140,3701,547,850,00027,979,0002,363,392
9Dec 28, 2025 14:2347,7881,601,347,8531,552,006,00024,984,0002,494,464