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 listJan 7, 2026 21:58Josu San MartinJosu San MartinScore: 16,817Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 22:2616,107560,706,748528,541,0002,997,0002,289,664
2Jan 7, 2026 21:5816,265561,689,539533,735,0002,998,0002,301,952
3Jan 7, 2026 22:2616,687574,112,198547,664,0002,998,0002,351,104
4Jan 7, 2026 22:2616,817584,571,712552,969,0001,999,0002,289,664
5Jan 7, 2026 21:5816,899586,313,029555,676,0001,998,0002,347,008
6Jan 7, 2026 21:5817,375597,782,088569,385,0003,995,0002,289,664