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 18, 2026 01:44M-RochatM-RochatScore: 27,672Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:4727,520918,747,487901,843,0006,333,0002,113,536
2May 18, 2026 01:4727,522917,685,144902,008,0006,223,0002,113,536
3May 18, 2026 01:4727,534918,990,913902,161,0006,461,0002,113,536
4May 18, 2026 01:4727,658922,230,216906,298,0006,427,0002,113,536
5May 18, 2026 01:4727,672925,008,720906,909,0006,296,0002,113,536
6May 18, 2026 01:4727,780927,607,127910,481,0006,280,0002,113,536
7May 18, 2026 01:4729,546987,531,905967,943,0007,075,0002,113,536
8May 18, 2026 01:4729,567985,781,081967,578,0008,141,0002,113,536
9May 18, 2026 01:4729,585988,144,811969,861,0006,466,0002,113,536