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 listMay 16, 2026 06:30M-RochatM-RochatScore: 91,427Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 06:3190,7173,004,594,1062,974,673,00018,988,0002,113,536
2May 16, 2026 06:3190,8663,008,185,6442,979,089,00019,491,0002,113,536
3May 16, 2026 06:3190,9413,012,014,8822,981,640,00019,428,0002,113,536
4May 16, 2026 06:3191,3433,023,239,8942,994,943,00019,377,0002,113,536
5May 16, 2026 06:3191,4273,028,999,2692,997,525,00019,595,0002,113,536
6May 16, 2026 06:3191,4973,030,027,5633,000,213,00019,217,0002,113,536
7May 16, 2026 06:3191,6523,033,380,3923,005,663,00018,878,0002,113,536
8May 16, 2026 06:3192,8283,075,163,5463,044,625,00018,705,0002,113,536
9May 16, 2026 06:3193,2123,085,843,4743,057,003,00018,999,0002,113,536