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 listAug 31, 2026 08:00Tomislav TunkovicTomislav TunkovicScore: 3,064Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 08:013,050110,609,91299,628,0001,054,00020,480
2Aug 31, 2026 08:013,051110,653,92099,630,0001,059,00020,480
3Aug 31, 2026 08:013,055110,816,04799,765,0001,060,00020,480
4Aug 31, 2026 08:013,062110,989,40599,983,0001,064,00020,480
5Aug 31, 2026 08:013,064111,034,928100,059,0001,053,00020,480
6Aug 31, 2026 08:013,066111,438,309100,140,0001,046,00020,480
7Aug 31, 2026 08:013,068111,147,378100,176,0001,075,00020,480
8Aug 31, 2026 08:013,071111,291,767100,320,0001,054,00020,480
9Aug 31, 2026 08:013,073111,397,403100,378,0001,048,00020,480