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 08:44M-RochatM-RochatScore: 28,063Success
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 08:4527,714925,383,153907,259,0007,323,0002,113,536
2May 16, 2026 08:4527,723925,431,223907,680,0007,193,0002,113,536
3May 16, 2026 08:4527,833928,068,999911,638,0006,869,0002,113,536
4May 16, 2026 08:4527,935933,615,040914,975,0006,895,0002,113,536
5May 16, 2026 08:4528,063935,646,782918,964,0007,123,0002,113,536
6May 16, 2026 08:4529,371979,369,179961,608,0007,638,0002,113,536
7May 16, 2026 08:4529,387980,584,926962,354,0007,441,0002,113,536
8May 16, 2026 08:4529,472984,404,065965,074,0007,526,0002,113,536
9May 16, 2026 08:4529,541983,759,104967,330,0007,544,0002,113,536