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 9, 2026 04:33Josu San MartinJosu San MartinScore: 8,751Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 04:338,706321,978,432279,295,0008,008,0002,387,968
2Jan 9, 2026 04:338,714312,221,219280,580,0006,989,0002,457,600
3Jan 9, 2026 04:338,721310,695,611278,809,0008,993,0002,363,392
4Jan 9, 2026 04:338,732310,290,472282,149,0006,003,0002,273,280
5Jan 9, 2026 04:338,751314,405,698281,781,0006,994,0002,306,048
6Jan 9, 2026 04:338,755315,176,145282,930,0005,998,0002,375,680
7Jan 9, 2026 04:338,789316,715,257283,052,0007,001,0002,273,280
8Jan 9, 2026 04:338,805322,764,693281,592,0008,987,0002,371,584
9Jan 9, 2026 04:338,810317,235,295281,753,0008,992,0002,326,528