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 8, 2026 22:39Josu San MartinJosu San MartinScore: 10,264Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 20:509,821349,814,728319,097,0005,001,0002,289,664
2Jan 8, 2026 20:509,827348,871,359320,276,0004,003,0002,334,720
3Jan 8, 2026 22:3910,030354,943,358325,990,0004,999,0002,461,696
4Jan 8, 2026 20:5010,264365,108,059334,727,0003,996,0002,347,008
5Jan 8, 2026 22:3910,583375,851,867345,259,0003,991,0002,355,200
6Jan 8, 2026 22:3910,608377,183,562348,052,0002,000,0002,338,816