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 listNov 12, 2025 19:08izotoffizotoffScore: 236,782Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2025 18:30234,8567,777,881,2967,619,303,000130,936,0002,297,856
2Nov 8, 2025 18:30236,0087,820,568,2467,672,325,000115,929,0002,449,408
3Nov 8, 2025 18:30236,7737,841,961,5227,685,591,000127,909,0002,502,656
4Nov 12, 2025 19:08236,7827,845,156,6877,662,913,000150,899,0002,486,272
5Nov 12, 2025 19:08237,1057,852,607,7417,696,541,000127,925,0002,490,368
6Nov 12, 2025 19:08237,3157,867,437,6097,702,476,000128,907,0002,367,488